Related papers: Expansions, omitting types, and standard systems
This article is concerned with classifying the provably total set-functions of Kripke-Platek set theory, KP, and Power Kripke-Platek set theory, KP(P), as well as proving several (partial) conservativity results. The main technical tool…
We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic…
The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability…
We introduce an extended tableau calculus for answer set programming (ASP). The proof system is based on the ASP tableaux defined in [Gebser&Schaub, ICLP 2006], with an added extension rule. We investigate the power of Extended ASP Tableaux…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
The saturation-based reasoning methods are among the most theoretically developed ones and are used by most of the state-of-the-art first-order logic reasoners. In the last decade there was a sharp increase in performance of such systems,…
Non-compact proofs are a class of reasoning that is used in mathematics but overlooked in the analysis of (un)provability of consistency. We focus on proofs of arithmetical statements (*) "for any natural number n, F(n)." A proof of (*) is…
In contexts in which the principle of dependent choice may not be available, as toposes or Constructive Set Theory, standard locale theoretic results related to complete regularity may fail to hold. To resolve this difficulty, B.…
We complete a 40-year old program on the computability-theoretic analysis of Ramsey's theorem, starting with Jockusch in 1972, and improving a result of Chong, Slaman and Yang in 2014. Given a set $X$, let $[X]^n$ be the collection of all…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…
For alternate Cantor real base numeration systems we generalize the result of Frougny and~Solomyak on~arithmetics on the set of numbers with finite expansion. We provide a class of alternate bases which satisfy the so-called finiteness…
We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…
We study Structural Reflection beyond Vop\v{e}nka's Principle, at the level of almost-huge cardinals and higher, up to rank-into-rank embeddings. We identify and classify new large cardinal notions in that region that correspond to some…
By the sometimes so-called MAIN THEOREM of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS'2000), Brattka (MLQ'2005), and Ziegler (ToCS'2006) have considered different relaxed notions…