Related papers: The Potential in Frege's Theorem
We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+. This…
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit…
In this paper, we provide a complete classification for the first-order Goedel logics concerning the property that the formulas admit logically equivalent prenex normal forms. We show that the only first-order Goedel logics that admit such…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
Here we deal with the logic of [GuSh 533], which tries to capture polynomial time (for finite models). There it is proved that the logic cannot say much on models with equality only. Here we prove that it cannot say much on models for which…
Classical mathematics (involving such notions as infinitely small/large and continuity) is usually treated as fundamental while finite mathematics is treated as inferior which is used only in special applications. We first argue that the…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
Mathematics and its relation to the physical universe have been the topic of speculation since the days of Pythagoras. Several different views of the nature of mathematics have been considered: Realism - mathematics exists and is…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
Some considerations showing that renormalizable theories with consistent perturbative theries can not be nonperturbatively finite (in terms of bare parameters) are provided. Accordingly any fundamental unified theory has to be either non…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…
We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…
Theorems crucial in elementary real function theory have proofs in which compactness arguments are used. Despite the introduction in relatively recent literature of each new highly elegant compactness argument, or of an equivalent, this…
General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…
The main question is: why and how can we ever predict based on a finite sample? The question is not answered by statistical learning theory. Here, I suggest that prediction requires belief in "predictability" of the underlying dependence,…
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…
Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The reason for that is that in first-order logic induction requires…
We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements--namely, preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such…