A wide range of intuitionistic type theories may be presented as equational theories within a logical framework. This method was formulated by Per Martin-Löf in the mid-1980's and further developed by Uemura, who used it to prove an initiality result for a class of models. Herein is presented a logical framework for type theories that includes an extensional equality type so that a type theory may be given by a signature of constants. The framework is illustrated by a number of examples of type-theoretic concepts, including identity and equality types, and a hierarchy of universes.
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either locally tabular or have some tautology. In particular, it is shown that a protoalgebraic logic admits an equational completeness theorem precisely when its has two distinct logically equivalent formulas. While the problem of determining whether a logic admits an equational completeness theorem is shown to be decidable both for logics presented by a finite set…
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality is a strengthening of stability. We show the equationality of the theory of proper extensions of algebraically closed fields of some fixed characteristic and of the theory of separably closed fields of arbitrary imperfection degree. Srour showed that the theory of differentially closed fields in positive characteristic is equational. We give also a d…
A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality is a strengthening of stability yet so far only two examples of non-equational stable theories are known. We construct non-equational $ω$-stable theories by a suitable colouring of the free pseudospace, based on Hrushovski and Srour's original example.
The Cardinalities of Intervals of Equational Theories and Logics
Institute of Discrete Mathematics and Geometry, TU Wien（维也纳工业大学离散数学与几何研究所）；Institute for Logic, Language and Computation, University of Amsterdam（阿姆斯特丹大学逻辑、语言与计算研究所）
In 1990, Johnstone gave a syntactic characterisation of the equational theories whose associated varieties are cartesian closed. Among such theories are all unary theories -- whose models are sets equipped with an action by a monoid M -- and all hyperaffine theories -- whose models are sets with an action by a Boolean algebra B. We improve on Johnstone's result by showing that an equational theory is cartesian closed just when its operations have a unique hyperaffine-unary decomposition. It follows that any non-degenerate cartesian closed variety is a variety of sets equipped with compatible a…
In a previous paper, the author and his collaborators studied the phenomenon of isotropy in the context of single-sorted equational theories, and showed that the isotropy group of the category of models of any such theory encodes a notion of inner automorphism for the theory. Using results from the treatment of combination problems in term rewriting theory, we show in this article that if $\mathbb{T}_1$ and $\mathbb{T}_2$ are (disjoint) equational theories satisfying minimal assumptions, then any free, finitely generated model of the disjoint union theory $\mathbb{T}_1 + \mathbb{T}_2$ has triv…
We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the conservativity of Extensional Type Theory over Intensional Type Theory. We generalize these methods to type theories without the Uniqueness of Identity Proofs principle, such as variants of Homotopy Type Theory, by introducing a notion of higher congruence over models of type theory. Our definition of higher congruence is inspired by Brunerie's type-theoretic defini…
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We finally provide examples of a number of set theories that are extensible.
The standard notion of formal theory, in Logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed to accept. In reviewing the main abstract approaches to the study of logical consequence, we point out why this notion of theory is unsatisfactory at multiple levels, and introduce a novel notion of theory that attacks the shortcomings of the received notion by allowing one to take both assertions and denials on a par. This novel notion of theory is based o…
Set theoretical paradoxes have a common root -- lack of understanding of why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do exist. However we do not understand this logical truth so well as we understand, for example, the logical truth $\forall x \ x=x$. In this paper, we formulate a logical truth which we call the productivity principle. Bertrand Rusell was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle expli…
It is well-known that natural axiomatic theories are pre-well-ordered by logical strength, according to various characterizations of logical strength such as consistency strength and inclusion of $Π^0_1$ theorems. Though these notions of logical strength coincide for natural theories, they are not generally equivalent. We study analogues of these notions -- such as $Π^1_1$-reflection strength and inclusion of $Π^1_1$ theorems -- in the presence of an oracle for $Σ^1_1$ truths. In this context these notions coincide; moreover, we get genuine pre-well-orderings of axiomatic theories and may drop…
