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

TL;DR: In this paper, it was shown that a universal class categorical in a high-enough cardinal is categorical on a tail of cardinals, and an explicit bound on the threshold of the categorical threshold was given.

TL;DR: It will be shown that all known ⋄-based constructions of κ-Souslin trees may be redirected through this new proxy principle, distinguished by the vector of parameters serving as its input.

TL;DR: It is shown that no tall F σ ideal is Ramsey, while there is a tall co-analytic Ramsey ideal.

TL;DR: This article investigates three infinitary Ramseyan statements by approximate the logical strength of these principles by the strength of their first-order iterated versions, known as density principles, and investigates their logical strength using strong initial segments of models of Peano Arithmetic.

TL;DR: It is proved that, if M is a bounded PRC or PpC field with exactly n orders or p-adic valuations respectively, then T h ( M ) is strong of burden n, which allows us to explicitly compute the burden of types, and to describe forking.

TL;DR: This paper considers a generalization of graphs named graphings, which is in some way a geometric realization of a graph, which leads to a number of new models of multiplicative-additive linear logic which generalize Girard's geometry of interaction models and opens several new lines of research.

TL;DR: Given any abstract notion of independence for Galois (orbital) types over models, it is derived that the notion satisfies a superstability property provided that the class is categorical and satisfies a weakening of amalgamation.

TL;DR: In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an individual valuation, which offers the possibility to give meaning to concepts such as dependence, independence and inclusion.

TL;DR: It is used orthogonality calculus to prove a downward transfer from categoricity in a successor in AECs that have a good frame (a forking-like notion for types of singletons) on an interval of cardinals and deduce improvements on the threshold of several categoricities transfers that do not mention frames.

TL;DR: The Continuum Hypothesis implies that every productively Menger set of real numbers is productively Hurewicz, and each ultrafilter version of Menger's property is strictly between menger's and HUREwicz's classic properties.

TL;DR: It is shown, following related results of Ghilardi and Zawadowski, that a combination of these properties provides a sufficient condition for the first-order theory of the variety to admit a model completion.

TL;DR: The proposed denotational model is the first one that supports the full features of a quantum functional programming language; it is proved adequacy of the semantics.

TL;DR: A notion of forking for Galois-types in the context of Abstract Elementary Classes (AECs) is developed and it is established that, if this notion is an independence notion, then it is the only one.

TL;DR: It is proved that the principle $ADC$ is strictly weaker than $ADS$ under Weihrauch (uniform) reducibility, and the more natural stable form ofADS is defined, which is the restriction ofADS to linear orders of type $\omega + \omega^*', where $k$ is a finite number.

TL;DR: A complete proof using a different modification of [6] is provided and the values of other natural generalizations of classical cardinal characteristics in the authors' model are studied.

TL;DR: The McKinsey–Tarski topological ‘dissection lemma’ is extended to the modal mu-calculus and to a logic of tangled closure operators that was developed by Fernandez-Duque after these two languages had been shown to have the same expressive power over finite transitive Kripke models.

TL;DR: This work provides algebraic foundations for substructural hypersequent calculi and an algorithm to transform P 3 axioms/equations into equivalent structural hypersequent rules, which are called hyper-MacNeille.

TL;DR: This paper investigates quite o-minimal theories having fewer than 2 ω countable models and proves that the Exchange Principle for algebraic closure holds in any model of such a theory and also proves binarity of these theories.

TL;DR: It is shown that up to first-order interdefinability ( H 3, E, 0 ) has 13 reducts and ( H n, E , 0) has 16 reduCTs for n ≥ 4 .

TL;DR: In this paper, the notion of collapse of generalized indiscernible sequences was used to classify various model theoretic dividing lines, such as op-dimension n, parameterized equivalence relations, and function space indiscernibles.

TL;DR: A branching-time logic is defined for reasoning about the equilibrium properties of game-like concurrent systems, where the components of the system act rationally and strategically in pursuit of logically-specified goals.

TL;DR: In this paper, it was shown that weak compactness can be characterized by the property that a regular cardinal κ is weakly compact if and only if every partial order satisfying the κ-chain condition is ρ-stationarily layered.

TL;DR: This addendum is to close a gap in the proof of [1, Theorem 11.2] , which characterizes the computational content of the Bolzano–Weierstras Theorem for arbitrary computable metric spaces.

TL;DR: This work develops machinery to make the Arithmetized Completeness Theorem more effective in the study of many models of I Δ 0 + B Σ 1 + exp, including all countable ones, by passing on to the conservative extension WKL 0 ⁎.

TL;DR: It is shown that a point x in a semicomputable set has a computable compact neighbourhood if x has a neighbourhood homeomorphic to Euclidean space.

TL;DR: This results in a model-theoretic characterization of expressive powers of arbitrary finite sets of guarded connectives of degree not exceeding 1 and regular connectives over the language of bounded lattices.

TL;DR: Labeled sequent calculi for justification logics, as well as for combined modal-justification logics are introduced, using a method due to Sara Negri to internalize the Kripke-style semantics of justification and modal–Fitting logics within the syntax of the sequent calculus.

TL;DR: In this paper, a semantics for the λ-calculus based on a topological duality theorem in nominal sets is given, and a novel interpretation of λ is given in terms of adjoints, and λ terms are interpreted as sets (no valuation is necessary).

TL;DR: It is shown that slow uniform Σ 1 -reflection is related to a function that has a considerably lower growth rate than F e 0 but dominates all functions F α with α e 0 in the fast-growing hierarchy.

TL;DR: In this article, asymptotic probabilities of first order and monadic second order properties of Bernoulli random graph G ( n, n − a ) were studied. But their results were restricted to the case where the probability tending to 0 or to 1 was known.