Related papers: Finitely Axiomatized Theories Lack Self-Comprehens…
We prove that persistently finite algebras are not created by completions of algebras, in any ordered discriminator variety. A persistently finite algebra is one without infinite simple extensions. We prove that finite measurable relation…
We extend a dichotomy between 1-basedness and supersimplicity proved in a previous paper. The generalization we get is to arbitrary language, with no restrictions on the topology (we do not demand type-definabilty of the open set in the…
We formulate and explore two basic axiomatic systems of typefree subjective probability. One of them explicates a notion of finitely additive probability. The other explicates a concept of infinitely additive probability. It is argued that…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…
I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…
In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
It is our aim to establish a general analytic theory of asymptotic expansions of type f(x)=a_1 phi_1(x)+dots+ a_n phi_n(x)+o(phi_n(x)), x tends to x_0 (*), where the given ordered n-tuple of real-valued functions phi_1 dots,phi_n forms an…
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…
We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate appropriate to such structures. We indicate the utility of this theory as a framework for the development…
Let $A$ be an infinitely generated free abelian group. We prove that the automorphism group $\aut A$ first-order interprets the full second-order theory of the set $|A|$ with no structure. In particular, this implies that the automorphism…
We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…
We formulate and discuss a general axiomatic theory of arbitrary objects. This theory is expressed in a simple first-order language without modal operators, and it is governed by classical logic.
We apply the algebraic theory of infinite classical lattices from Part I to write an axiomatic theory of measurements, based on Mackey's axioms for quantum mechanics. The axioms give a complete theory of measurements in the sense of Haag…
We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the…
The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…
We prove that the Fibonacci Lie algebra and the related just infinite self-similar Lie algebra are not finitely presented.
We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is "sub-multiplicative" in arbitrary theories (in particular, if a theory has TP2 then there…