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 email@example.com with any questions.
We investigate club guessing sequences and filters. We prove that assuming V=L, there exists a strong club guessing sequence on μ if and only if μ is not ineffable for every uncountable regular cardinal μ. We also prove that for every uncountable regular cardinal μ, relative to the existence of a Woodin cardinal above μ, it is consistent that every tail club guessing ideal on μ is precipitous.
In 1984, Danecki proved that satisfiability in IPDL, i.e., Propositional Dynamic Logic (PDL) extended with an intersection operator on programs, is decidable in deterministic double exponential time. Since then, the exact complexity of IPDL has remained an open problem: the best known lower bound was the ExpTime one stemming from plain PDL until, in 2004, the first author established ExpSpace-hardness. In this paper, we finally close the gap and prove that IPDL is hard for 2-ExpTime, thus 2-ExpTime-complete. We then sharpen our lower bound, showing that it even applies to IPDL without the test operator interpreted on tree structures.
A fragment with the same provably recursive functions as n iterated inductive definitions is obtained by restricting second order arithmetic in the following way. The underlying language allows only up to n+1 nested second order quantifications and those are in such a way, that no second order variable occurs free in the scope of another second order quantifier. The amount of induction on arithmetical formulae only affects the arithmetical consequences of these theories, whereas adding induction for arbitrary formulae increases the strength by one inductive definition.
In this paper we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness, and we show how normalisation in this system corresponds to cut elimination in the sequent calculus for lattice logic. This natural deduction system is inspired both by Shoesmith and Smiley’s multiple conclusion systems for classical logic and Girard’s proofnets for linear logic.
We investigate logical consequence in temporal logics in terms of logical consecutions, i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be ’correct’ in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈 𝒵, ≤, ≥ 〉 of all integer numbers, is the prime object of our investigation. We describe consecutions admissible in LDTL in a semantic way—via consecutions valid in special temporal Kripke/Hintikka models. Then we state that any temporal inference rule has a reduced normal form which is given in terms of uniform formulas of temporal degree 1. Using these facts and enhanced semantic techniques we construct an algorithm, which recognizes consecutions admissible in LDTL. Also, we note that using the same technique it follows that the linear temporal logic ℒ(𝒩) of all natural numbers is also decidable w.r.t. inference rules. So, we prove that both logics LDTL and ℒ(𝒩) are decidable w.r.t. admissible consecutions. In particular, as a consequence, they both are decidable (known fact), and the given deciding algorithms are explicit.
We show that infinite sets whose power-sets are Dedekind-finite can only carry ℵ0-categorical first order structures. We identify other subclasses of this class of Dedekind-finite sets, and discuss their possible first order structures.
This article will study a class of deduction systems that allow for a limited use of the modus ponens method of deduction. We will show that it is possible to devise axiom systems α that can recognize their consistency under a deduction system D provided that: (1) α treats multiplication as a 3-way relation (rather than as a total function), and that (2) D does not allow for the use of a modus ponens methodology above essentially the levels of Π1 and Σ1 formulae.
Part of what will make this boundary-case exception to the Second Incompleteness Theorem interesting is that we will also characterize generalizations of the Second Incompleteness Theorem that take force when we only slightly weaken the assumptions of our boundary-case exceptions in any of several further directions.
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among others, this gives some true co-analytic sets. The case where the dictionary is finite is studied and gives a natural example of a set at level ω of the Wadge hierarchy.
This paper proves that the disjunction property, the numerical existence property, Church’s rule, and several other metamathematical properties hold true for Constructive Zermelo-Fraenkel Set Theory, CZF, and also for the theory CZF augmented by the Regular Extension Axiom.
As regards the proof technique, it features a self-validating semantics for CZF that combines realizability for extensional set theory and truth.
We consider a family 𝔲 of finite universes. The second order existential quantifier Qℜ, means for each U∈ 𝔲 quantifying over a set of n(ℜ)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called interpretability. We show that for every Qℜ, either Qℜ is interpretable by quantifying over subsets of U and one to one functions on U both of bounded order, or the logic L(Qℜ) (first order logic plus the quantifier Qℜ) is undecidable.
Families of Borel equivalence relations and quasiorders that are cofinal with respect to the Borel reducibility ordering, ≤B, are constructed. There is an analytic ideal on ω generating a complete analytic equivalence relation and any Borel equivalence relation reduces to one generated by a Borel ideal. Several Borel equivalence relations, among them Lipschitz isomorphism of compact metric spaces, are shown to be Kσ complete.
We construct the finitely generated free algebras and determine the free spectra of varieties of linear equivalential algebras and linear equivalential algebras of finite height corresponding, respectively, to the equivalential fragments of intermediate Gödel-Dummett logic and intermediate finite-valued logics of Gödel. Thus we compute the number of purely equivalential propositional formulas in these logics in n variables for an arbitrary n∈ℕ.
We define a notion of genericity for arbitrary subgroups of groups interpretable in a simple theory, and show that a type generic for such a group is generic for the minimal hyperdefinable supergroup (the definable hull). In particular, at least one generic type of the definable hull is finitely satisfiable in the original subgroup. If the subgroup is a subfield, then the additive and the multiplicative definable hull both have bounded index in the smallest hyperdefinable superfield.
PURCHASE SINGLE ARTICLE
This article is only available to subscribers. It is not available for individual sale.