Strong Ambiguity

Mathematical Logic Quarterly 68 (1):110-117 (2022)
  Copy   BIBTEX

Abstract

We examine the conditions under which a model of Tangled Type Theory satisfies the same sentences as a model of (assuming we ignore type indices).

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,173

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Some coinductive graphs.A. H. Lachlan - 1990 - Archive for Mathematical Logic 29 (4):213-229.
Adding Skolem functions to simple theories.Herwig Nübling - 2004 - Archive for Mathematical Logic 43 (3):359-370.
An infinitary propositional probability logic.Stefano Baratella - 2023 - Archive for Mathematical Logic 62 (3):291-320.
Forking and Incomplete Types.Tapani Hyttinen - 1996 - Mathematical Logic Quarterly 42 (1):421-432.
On definability of types and relative stability.Viktor Verbovskiy - 2019 - Mathematical Logic Quarterly 65 (3):332-346.
Constructive Sheaf Semantics.Erik Palmgren - 1997 - Mathematical Logic Quarterly 43 (3):321-327.
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem.Denis Roman Hirschfeldt - 2017 - Providence, Rhode Island: American Mathematical Society. Edited by Karen Lange & Richard A. Shore.
Combinatorial realizability models of type theory.Pieter Hofstra & Michael A. Warren - 2013 - Annals of Pure and Applied Logic 164 (10):957-988.

Analytics

Added to PP
2022-04-10

Downloads
29 (#772,073)

6 months
6 (#851,951)

Historical graph of downloads
How can I increase my downloads?