English
Related papers

Related papers: Infinitary Logics and Abstract Elementary Classes

200 papers

Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…

Logic · Mathematics 2020-05-26 T. Moraschini , J. G. Raftery , J. J. Wannenburg

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

Logic · Mathematics 2013-07-24 Moti Gitik , Saharon Shelah

We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…

Logic in Computer Science · Computer Science 2016-04-29 Ugo Dal Lago

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

Category Theory · Mathematics 2015-07-22 Martin Hyland

We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same…

Logic in Computer Science · Computer Science 2018-02-13 Paulin Fournier , Hugo Gimbert

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

This paper is a contribution to "neo-stability" type of result for abstract elementary classes. Under certain set theoretic assumptions, we propose a definition and a characterization of NIP in AECs. The class of AECs with NIP properly…

Logic · Mathematics 2025-10-28 Wentao Yang

We use the algebraic framework for languages of infinite trees introduced in [4] to derive effective characterisations of various temporal logics, in particular the logic EF (a fragment of CTL) and its counting variant cEF.

Logic in Computer Science · Computer Science 2022-03-29 Achim Blumensath , Jakub Lédl

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

Logic · Mathematics 2016-09-07 Bradd Hart , Ehud Hrushovski , Michael C. Laskowski

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Logic · Mathematics 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

We introduce the framework of AECats (abstract elementary categories), generalising both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory ("cat", as introduced…

Logic · Mathematics 2023-03-24 Mark Kamsma

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

Logic · Mathematics 2015-04-21 Richard Zach

We study abstract elementary classes (AECs) that, in $\aleph_0$, have amalgamation, joint embedding, no maximal models and are stable (in terms of the number of orbital types). Assuming a locality property for types, we prove that such…

Logic · Mathematics 2018-05-31 Saharon Shelah , Sebastien Vasey

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…

Logic · Mathematics 2026-05-07 Saharon Shelah

Tame abstract elementary classes are a broad nonelementary framework for model theory that encompasses several examples of interest. In recent years, progress toward developing a classification theory for them have been made. Abstract…

Logic · Mathematics 2017-10-27 Will Boney , Sebastien Vasey

We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…

Logic · Mathematics 2013-06-28 Luca Motto Ros

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Logic in Computer Science · Computer Science 2019-02-05 Stefan Milius , Henning Urbat

In a recent work the authors prove the effective asymptotic Fermat's Last Theorem for the infinite family of fields $\mathbb{Q}(\zeta_{2^{r+2}})^+$ where $r \ge 0$. A crucial step in their proof is the following conjecture of Kraus. Let $K$…

Number Theory · Mathematics 2020-12-08 Nuno Freitas , Alain Kraus , Samir Siksek

We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…

Logic in Computer Science · Computer Science 2017-05-15 Abhisekh Sankaran

One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…

Logic in Computer Science · Computer Science 2023-04-27 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz
‹ Prev 1 3 4 5 6 7 10 Next ›