Registered users receive a variety of benefits including the ability to customize email alerts, create favorite journals list, and save searches.
Please note that a Project Euclid web account does not automatically grant access to full-text content. An institutional or society member subscription is required to view non-Open Access content.
Contact firstname.lastname@example.org with any questions.
We prove a number of results concerning the variety of first-order theories and isomorphism types of pairs of the form , where is a countable recursively saturated model of Peano Arithmetic and is its cofinal submodel. We identify two new isomorphism invariants for such pairs. In the strongest result we obtain continuum many theories of such pairs with the fixed greatest common initial segment of and and fixed lattice of interstructures , such that .
For any extension of having a cut-elimination property extending that of , the number of different proofs that can be obtained by cut elimination from a single -proof cannot be bound by a function which is provably total in .
This paper develops a formal system, consisting of a language and semantics, called serial logic (SL). In rough outline, SL permits quantification over, and reference to, some finite number of things in an order, in an ordinary everyday sense of the word “order,” and superplural quantification over things thus ordered. Before we discuss SL itself, some mention should be made of an issue in philosophical logic which provides the background to the development of SL, and with respect to which I wish to contend that the system permits progress.
We prove that each countable rooted K4-frame is a d-morphic image of a subspace of the space of rational numbers. From this we derive that each modal logic over K4 axiomatizable by variable-free formulas is the d-logic of a subspace of . It follows that subspaces of give rise to continuum many d-logics over K4, continuum many of which are neither finitely axiomatizable nor decidable. In addition, we exhibit several families of modal logics finitely axiomatizable by variable-free formulas over K4 that d-define interesting classes of topological spaces. Each of these logics has the finite model property and is decidable. Finally, we introduce quasi-scattered and semi-scattered spaces as generalizations of scattered spaces, develop their basic properties, axiomatize their corresponding modal logics, and show that they also arise as the d-logics of some subspaces of .
V’yugin has shown that there are a computable shift-invariant measure on and a simple function such that there is no computable bound on the rate of convergence of the ergodic averages . Here it is shown that in fact one can construct an example with the property that there is no computable bound on the complexity of the limit; that is, there is no computable bound on how complex a simple function needs to be to approximate the limit to within a given .
We give upper and lower bounds for the strength of ordinal definable determinacy in a small admissible set. The upper bound is roughly a premouse with a measurable cardinal of Mitchell order and successors. The lower bound are models of ZFC with sequences of measurable cardinals, extending the work of Lewis, below a regular limit of measurable cardinals.
We study the reverse mathematics of pigeonhole principles for finite powers of the ordinal . Four natural formulations are presented, and their relative strengths are compared. In the analysis of the pigeonhole principle for , we uncover two weak variants of Ramsey’s theorem for pairs.
Given an ideal , let denote the forcing with -positive sets. We consider models of forcing axioms which also have a normal ideal with completeness such that . Using a bit more than a superhuge cardinal, we produce a model of PFA (proper forcing axiom) which has many ideals on whose associated forcings are proper; a similar phenomenon is also observed in the standard model of obtained from a supercompact cardinal. Our model of PFA also exhibits weaker versions of ideal properties, which were shown by Foreman and Magidor to be inconsistent with PFA.
Along the way, we also show (1) the diagonal reflection principle for internally club sets () introduced by the author in earlier work is equivalent to a natural weakening of “there is an ideal such that is proper”; and (2) for many natural classes of posets, is equivalent to an apparently stronger version which we call .
We expand the notion of resplendency to theories of the kind , where is a first-order theory and expresses that the type is omitted; both and are in languages extending the base language. We investigate two different formulations and prove necessary and sufficient conditions for countable recursively saturated models of PA.