Let ZFB be ZF + “every set is the same size as a wellfounded set”. Then the following are true.

Every sentence true in every (Rieger-Bernays) permutation model of a model of ZF is a theorem of ZFB. (i.e., ZFB is the theory of Rieger-Bernays permutation models of models of ZF) ZF and ZFAFA are both extensions of ZFB conservative for stratified formulæ. The class of models of ZFB is closed under creation of Rieger-Bernays permutation models.

A Liouville function is an analytic function H: ℂ → ℂ with a Taylor series such the an's form a “very fast growing” sequence of integers. In this paper we exhibit the complete first-order theory of the complex field expanded with H.

Our main results are:

Theorem 1. Con(ZFC + “every function f: ω1 → ω1 is dominated by a canonical function”) implies Con(ZFC + “there exists an inaccessible limit of measurable cardinals”). [In fact equiconsistency holds.]

Theorem 3. Con(ZFC + “there exists a non-regular uniform ultrafilter on ω1”) implies Con(ZFC + “there exists an inaccessible stationary limit of measurable cardinals”).

Theorem 5. Con (ZFC + “there exists an ω1-sequence of ω1-complete uniform filters on ω1 s.t. every A ⊆ ω1 is measurable w.r.t. a filter in (Ulam property)”) implies Con(ZFC + “there exists an inaccessible stationary limit of measurable cardinals”).

We start with a discussion of the canonical functions and look at some combinatorial principles. Assuming the domination property of Theorem 1, we use the Ketonen diagram to show that ω2V is a limit of measurable cardinals in Jensen's core model KMO for measures of order zero. Using related arguments we show that ω2V is a stationary limit of measurable cardinals in KMO, if there exists a weakly normal ultrafilter on ω1. The proof yields some other results, e.g., on the consistency strength of weak*-saturated filters on ω1, which are of interest in view of the classical Ulam problem.

Let n ≥ 3 be an integer. We show that it is consistent (relative to the consistency of n − 2 strong cardinals) that every Σ1n-set of reals is universally Baire yet there is a (lightface) projective well-ordering of the reals. The proof uses “David's trick” in the presence of inner models with strong cardinals.

For α less than ε0 let Nα be the number of occurrences of ω in the Cantor normal form of α. Further let ∣n∣ denote the binary length of a natural number n, let ∣n∣h denote the h-times iterated binary length of n and let inv(n) be the least h such that ∣n∣h ≤ 2. We show that for any natural number h first order Peano arithmetic, PA, does not prove the following sentence: For all K there exists an M which bounds the lengths n of all strictly descending sequences 〈α0, …, αn〉 of ordinals less than ε0 which satisfy the condition that the Norm Nαi of the i-th term αi is bounded by K + ∣i∣ · ∣i∣i.

As a supplement to this (refined Friedman style) independence result we further show that e.g., primitive recursive arithmetic, PRA, proves that for all K there is an M which bounds the length n of any strictly descending sequence 〈α0, …, αn〉 of ordinals less than ε0 which satisfies the condition that the Norm Nαi of the i-th term αi is bounded by K + ∣i∣ · inv(i). The proofs are based on results from proof theory and techniques from asymptotic analysis of Polya-style enumerations.

Using results from Otter and from Matoušek and Loebl we obtain similar characterizations for finite bad sequences of finite trees in terms of Otter's tree constant 2.9557652856.…

The paper is concerned with the existence of a universal graph at the successor of a strong limit singular μ of cofinality ℵ0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for some such μ there are μ++ graphs on μ+ that taken jointly are universal for the graphs on μ+, while .

The paper also addresses the general problem of obtaining a framework for consistency results at the successor of a singular strong limit starting from the assumption that a supercompact cardinal κ exists. The result on the existence of universal graphs is obtained as a specific application of a more general method.

The generality of a derivation is an equivalence relation on the set of occurrences of variables in its premises and conclusion such that two occurrences of the same variable are in this relation if and only if they must remain occurrences of the same variable in every generalization of the derivation. The variables in question are propositional or of another type. A generalization of the derivation consists in diversifying variables without changing the rules of inference.

This paper examines in the setting of categorial proof theory the conjecture that two derivations with the same premises and conclusions stand for the same proof if and only if they have the same generality. For that purpose generality is defined within a category whose arrows are equivalence relations on finite ordinals, where composition is rather complicated. Several examples are given of deductive systems of derivations covering fragments of logic, with the associated map into the category of equivalence relations of generality.

This category is isomorphically represented in the category whose arrows are binary relations between finite ordinals, where composition is the usual simple composition of relations. This representation is related to a classical representation result of Richard Brauer.

The use of Nepomnjaščiǐ's Theorem in the proofs of independence results for bounded arithmetic theories is investigated. Using this result and similar ideas, it is shown that at least one of S1 or TLS does not prove the Matiyasevich-Robinson-Davis-Putnam Theorem. It is also established that TLS does not prove a statement that roughly means nondeterministic linear time is equal to co-nondeterministic linear time. Here S1 is a conservative extension of the well-studied theory IΔ0 and TLS is a theory for LOGSPACE reasoning.

We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, IΔ1. We show that IΔ1 is independent from the set of all true arithmetical Π2-sentences. Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of Δ1-induction.

An open problem formulated by J. Paris (see [4, 5]) is whether IΔ1 proves the corresponding least element principle for decidable predicates, LΔ1 (or, equivalently, the Σ1-collection principle BΣ1). We reduce this question to a purely computation-theoretic one.

Restricted to first-order formulas, the rules of inference in the Curry-Howard type theory are equivalent to those of first-order predicate logic as formalized by Heyting, with one exception: ∃-elimination in the Curry-Howard theory, where ∃x: A,F(x) is understood as disjoint union, are the projections, and these do not preserve first-orderedness. This note shows, however, that the Curry-Howard theory is conservative over Heyting's system.

Why is forcing the only known method for constructing outer models of set theory?

If V is a standard transitive model of ZFC, then a standard transitive model W of ZFC is an outer model of V if V ⊆ W and V ∩ OR = W ∩ OR.

Is every outer model of a given model a generic extension? At one point Solovay conjectured that if 0# exists, then every real that does not construct 0# lies in L[G], for some G that is generic for some forcing ℙ ∈ L. Famously, this was refuted by Jensen's coding theorem. He produced a real that is generic for an L-definable class forcing property, but does not lie in any set forcing extension of L.

Beller, Jensen, and Welch in Coding the universe [BJW] revived Solovay's conjecture by asking the following question: Let a ⊆ ω be such that L[a] ⊨ “0# does not exist”. Is there ab∈ L[a] such that a ∉ L[b] and a is set generic over L[b].

We combine a variety of constructive methods (including forcing, realizability, asymmetric interpretation), to obtain consistency results concerning combinatory logic with extensionality and (forms of) the axiom of choice.

Let (M, ≤,…) denote a Boolean ordered o-minimal structure. We prove that a Boolean subalgebra of M determined by an algebraically closed subset contains no dense atoms. We show that Boolean algebras with finitely many atoms do not admit proper expansions with o-minimal theory. The proof involves decomposition of any definable set into finitely many pairwise disjoint cells, i.e., definable sets of an especially simple nature. This leads to the conclusion that Boolean ordered structures with o-minimal theories are essentially bidefinable with Boolean algebras with finitely many atoms, expanded by naming constants. We also discuss the problem of existence of proper o-minimal expansions of Boolean algebras.

We define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic Λsim in the diamond language with each logic Λ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/recursive axiomatizability, frame completeness and the finite model property, canonicity and first-order definability.

The theory of ranked partial structures allows a reinterpretation of several of the standard results of model theory and first-order logic and is intended to provide a proof-theoretic method which allows for the intuitions of model theory. A version of the downward Löwenheim-Skolem theorem is central to our development. In this paper we will present the basic theory of ranked partial structures and their logic including an appropriate version of the completeness theorem.

We study the problem of existence and generic existence of ultrafilters on ω. We prove a conjecture of Jörg Brendle's showing that there is an ultrafilter that is countably closed but is not an ordinal ultrafilter under CH. We also show that Canjar's previous partial characterization of the generic existence of Q-points is the best that can be done. More simply put, there is no normal cardinal invariant equality that fully characterizes the generic existence of Q-points. We then sharpen results on generic existence with the introduction of σ-compact ultrafilters. We show that the generic existence of said ultrafilters is equivalent to . This result, taken along with our result that there exists a Kσ, non-countably closed ultrafilter under CH, expands the size of the class of ultrafilters that were known to fit this description before. From the core of the proof, we get a new result on the cardinal invariants of the continuum, i.e., the cofinality of the sets with σ-compact closure is .

In “Bounding minimal degrees by computably enumerable degrees” by A. Li and D. Yang, (this Journal, [1998]), the authors prove that there exist non-computable computably enumerable degrees c > a > 0 such that any minimal degree m being below c is also below a. We analyze the proof of their result and show that the proof contains a mistake. Instead we give a proof for the opposite result.

Craig's interpolation lemma (if φ → ψ is valid, then φ → θ and θ → ψ are valid, for θ a formula constructed using only primitive symbols which occur both in φ and ψ) fails for many propositional and first order modal logics. The interpolation property is often regarded as a sign of well-matched syntax and semantics. Hybrid logicians claim that modal logic is missing important syntactic machinery, namely tools for referring to worlds, and that adding such machinery solves many technical problems. The paper presents strong evidence for this claim by defining interpolation algorithms for both propositional and first order hybrid logic. These algorithms produce interpolants for the hybrid logic of every elementary class of frames satisfying the property that a frame is in the class if and only if all its point-generated subframes are in the class. In addition, on the class of all frames, the basic algorithm is conservative: on purely modal input it computes interpolants in which the hybrid syntactic machinery does not occur.

Let M be an o-minimal expansion of an ordered field. Let φ be a formula in the language of ordered domains. In this note we establish some topological properties which are transferred from φM to φR and vice versa. Then, we apply these transfer results to give a new proof of a result of M. Edmundo—based on the work of A. Strzebonski—showing the existence of torsion points in any definably compact group defined in an o-minimal expansion of an ordered field.

We generalize tools and results from first order stable theories to groups inside a simple stable strongly homogeneous model.