Showing papers in "Annals of Pure and Applied Logic in 2010"

TL;DR: In this article, the decision problem for the temporal logic with until and since connectives over real-numbers time is shown to be PSPACE-complete, which is the most practically useful dense time temporal logic.

TL;DR: Tensor logic is introduced, a primitive variant of linear logic where negation is not involutive, and interpreted in a model based on Conway games equipped with a notion of payoff, in order to reflect the various resource policies of the logic.

TL;DR: It is proved that any MV-algebra is isomorphic to the MV- algebra of all global sections of a sheaf of MV-chains on a compact topological space, and why the representation theorem can be viewed as a vast generalization of McNaughton’s theorem.

TL;DR: In this paper, a Kripke semantics characterization is given for the (hereditarily) structurally complete implication-negation fragments of intermediate logics, and it is shown that the admissible rules of this fragment of IPC form a PSPACE-complete set and have no finite basis.

TL;DR: For a large natural class of forcing notions, this work proves general equivalence theorems between forcing absoluteness statements, regularity properties, and transcendence properties over L and the core model K to answer open questions from set theory of the reals.

TL;DR: A Gentzen-style sequent system GL is presented that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of Lambek Calculus FL, and an equivalent Hilbert-style system HL is introduced.

TL;DR: The Peterzil–Starchenko trichotomy theorem is used to characterize for a sufficiently general point, the local geometry around it in terms of the thorn U-rank of its type inside a lovely pair of geometric structures.

TL;DR: This paper provides a complete Kripke semantics for GLP and isolates a certain subsystem J of GLP that is sound and complete w.r.t. a nice class of flnite frames.

TL;DR: A new approach to independent quantifiers, as originally introduced in Informational independence as a semantic phenomenon by Hintikka and Sandu (1989) under the header of independence-friendly languages, is introduced.

TL;DR: Using countable support iterations of S-proper posets, it is shown that the existence of a Δ31 definable wellorder of the reals is consistent with each of the following: d, d, and d.

TL;DR: A general and uniform method to prove axiomatic completeness for certain modal fixpoint logics and the soundness and completeness of an extension of this method are proved.

TL;DR: This paper presents a correct characterization of subdirectly irreducible state-morphism MV-algebras and the main theorem, which has a gap in the proof of Claim 10.

TL;DR: A notion of Kripke model for classical logic for which it constructively prove soundness and cut-free completeness is introduced.

TL;DR: Baro and Otero as discussed by the authors extended these results to the category of locally definable spaces, for which they introduced homology and homotopy functors, and studied the concept of connectedness in V-definable groups.

TL;DR: In this paper, the authors examined the effective content of these and related results by studying effectively Borel equivalence relations under Borel reducibility, and showed that for any recursive ordinal α the existence of Π 1 0 singletons whose α -jumps are Turing incomparable.

TL;DR: This paper presents classical proof forests as a graphical proof formalism and investigates the possibility of composing forests by cut-elimination, using a modified version of the rewrite relation inspired by the game-theoretic interpretation of the forests.

TL;DR: A criterion under which the expansion still admits a model-completion is given which is axiomatize, and an Ax–Kochen–Ershov theorem is proved.

TL;DR: A uniform modal logic framework is proposed for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the comparison and combination of logics from distinct research traditions such as Tarski’s View the MathML source for topological closure and interior, conditional logics, and logics of comparative similarity.

TL;DR: This work explains how the problem of preservation of totality by composition in arena games reduces to a niteness theorem on what they call pointer structures, similar to the parity pointer functions of Harmer, Hyland & Melli es and the interaction sequences of Coquand.

TL;DR: In this article, it was shown that there is a regular cardinal θ μ such that any fewer than cf (μ ) stationary subsets of S ≥ θ σ ≥ σ σ + 2 must reflect simultaneously.

TL;DR: It is proved that the varieties of Hilbert and Tarski algebras are canonical in this new sense in the algebraic counterpart AlgS of any finitary and congruential logic S.

TL;DR: This work presents a setting in which the search for a proof of B or a refutation of B can be carried out simultaneously: in contrast, the usual approach in automated deduction views proving B or proving ¬B as two, possibly unrelated, activities.

TL;DR: It is shown that, with respect to full reduction, it is not possible to define a sound and complete intersection and union type assignment system for λ ¯ μ μ .

TL;DR: It is argued that the former notion of a point is more useful than the latter one from a category theoretic point of view and that theFormer notion ofA point actually represents a polytope (or generic point) and the latter notion ofa point properly represents a point.

TL;DR: A sound and complete proof system for a language L e + Y that adds to Dynamic Epistemic Logic a discrete previous-time operator as well as single symbol formulas that partially reveal the most recent event that occurred is provided.

TL;DR: In this paper, the authors propose a general way of constructing authentication schemes from actions of a semigroup on a set, without exploiting any speciflc algebraic properties of the set acted upon.

TL;DR: The (effective) Suslin–Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it a naive realizability interpretation.

TL;DR: A logic D capable of expressing dependence of a variable on designated variables only, which has similar goals to the Henkin quantifiers of [4] and the independence friendly logic of [6] that it much resembles.

TL;DR: For each integer n ≥ 0, this work provides an explicit functional characterization of the free n -generated BL-algebra, together with an explicit construction of the corresponding normal forms.

TL;DR: A necessary and sufficient condition in terms of a de Finetti style representation is given for a probability function in Polyadic Inductive Logic to satisfy being part of a Language Invariant family satisfying Spectrum Exchangeability.