English
Related papers

Related papers: On Some Infinitary Logics

200 papers

We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…

Logic · Mathematics 2026-04-24 Jonathan Osinski , Trevor Wilson

We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $\omega$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique…

Logic · Mathematics 2026-04-29 John T. Baldwin , Constantin C. Brîncuş

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory

Logic · Mathematics 2013-04-08 Tarek Sayed Ahmed

We ask, when is a property of a model a logical property? According to the so-called Tarski-Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics…

Logic · Mathematics 2021-07-13 Juliette Kennedy , Jouko Väänänen

Logical frameworks can be used to translate proofs from a proof system to another one. For this purpose, we should be able to encode the theory of the proof system in the logical framework. The Lambda Pi calculus modulo theory is one of…

Logic in Computer Science · Computer Science 2023-10-26 Yoan Géran

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

Logic in Computer Science · Computer Science 2018-08-16 Daniel Leivant

This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…

Category Theory · Mathematics 2014-10-16 Michal R. Przybylek

Lindstr\"om theorem obviously fails as a characterization of $\mathcal{L}_{\omega \omega}^{-} $, first-order logic without identity. In this note we provide a fix: we show that $\mathcal{L}_{\omega \omega}^{-} $ is \emph{maximal} among…

Logic · Mathematics 2022-12-07 Guillermo Badia , Xavier Caicedo , Carles Noguera

The ultrapower theorem of Keisler-Shelah allows such model-theoretic notions as elementary equivalence, elementary embedding and existential embedding to be couched in the language of categories (limits, morphism diagrams). This in turn…

Logic · Mathematics 2008-02-03 Paul Bankston

The classifying topos of a geometric theory is a topos such that geometric morphisms into it correspond to models of that theory. We study classifying toposes for different infinitary logics: first-order, sub-first-order (i.e. geometric…

Category Theory · Mathematics 2023-12-20 Mark Kamsma

We show that, up to terms of order 1/kappa^5, the kappa-deformed Poincare algebra can be endowed with a triangular quasibialgebra structure. The universal R matrix and coassociator are given explicitly to the first few orders. In the…

High Energy Physics - Theory · Physics 2009-01-26 C. A. S. Young , R. Zegers

We prove undecidability and pinpoint the place in the arithmetical hierarchy for commutative action logic, that is, the equational theory of commutative residuated Kleene lattices (action lattices), and infinitary commutative action logic,…

Logic · Mathematics 2021-02-24 Stepan L. Kuznetsov

When classes of structures are not first-order definable, we might still try to find a nice description. There are two common ways for doing this. One is to expand the language, leading to notions of pseudo-elementary classes, and the other…

Logic · Mathematics 2020-05-01 Will Boney , Barbara F. Csima , Nancy A. Day , Matthew Harrison-Trainor

There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…

Logic · Mathematics 2016-09-06 Thomas Jech , Saharon Shelah

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Logic · Mathematics 2023-09-20 Philipp Lücke , Sandra Müller

Originally introduced by Kolmann and Shelah as a surrogate for saturated models, limit models have been established as natural and useful objects when studying abstract elementary classes. Shelah began the study of when (multiple notions…

Logic · Mathematics 2025-10-29 Jeremy Beard

We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…

Logic · Mathematics 2026-03-13 Farmer Schlutzenberg

We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…

Logic · Mathematics 2019-12-10 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

We present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $(B_0, \dots)$, let $B_1, B_2, \dots, B_K$ be sets that either intersect $B_0$ or…

Rings and Algebras · Mathematics 2013-10-10 William DeMeo