English
Related papers

Related papers: Practical and Structural Infinitary Expansions

200 papers

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…

Logic · Mathematics 2019-02-04 Christian Espíndola

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

Morrey (function) spaces and, in particular, smoothness spaces of Besov-Morrey or Triebel-Lizorkin-Morrey type enjoyed a lot of interest recently. Here we turn our attention to Morrey sequence spaces $m_{u,p}=m_{u,p}(\mathbb{Z}^d)$,…

Functional Analysis · Mathematics 2018-07-04 Dorothee D. Haroske , Leszek Skrzypczak

In this paper we study a notion of HL-extension (HL standing for Herwig--Lascar) for a structure in a finite relational language $\mathcal{L}$. We give a description of all finite minimal HL-extensions of a given finite…

Logic · Mathematics 2020-07-22 Mahmood Etedadialiabadi , Su Gao

We prove that in every ring of generalised power series with non-positive real exponents and coefficients in a field of characteristic zero, every series admits a factorisation into finitely many irreducibles of infinite support, the number…

Logic · Mathematics 2024-03-05 Sonia L'Innocente , Vincenzo Mantova

We develop an analogue of the classical Scott analysis for metric structures and infinitary continuous logic. Among our results are the existence of Scott sentences for metric structures and a version of the Lopez-Escobar theorem. We also…

Logic · Mathematics 2017-08-03 Itai Ben Yaacov , Michal Doucha , Andre Nies , Todor Tsankov

We give a notion of Scott rank for separable metric structures based on the definability of the (metric closures of) automorphism orbits in continuous infinitary logic. This is a continuous analogue of work of Montalb\'an for countable…

Logic · Mathematics 2024-11-05 Diego Bejarano

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

This article is concerned with classes of relational structures that are closed under taking substructures and isomorphism, that have the joint embedding property, and that furthermore have the Ramsey property, a strong combinatorial…

Combinatorics · Mathematics 2015-05-28 Manuel Bodirsky

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of…

The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…

Logic in Computer Science · Computer Science 2026-03-27 Christine Tasson , Aymeric Walch

Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…

Logic · Mathematics 2013-02-12 Stephen Flood

Structural-equations models (SEMs) are perhaps the most commonly used framework for modeling causality. However, as we show, naively extending this framework to infinitely many variables, which is necessary, for example, to model dynamical…

Artificial Intelligence · Computer Science 2021-12-20 Spencer Peters , Joseph Y. Halpern

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

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

We introduce a generalization of sequential compactness using barriers on $\omega$ extending naturally the notion introduced in [W. Kubi\'{s} and P. Szeptycki, On a topological Ramsey theorem, \emph{Canad. Math. Bull.}, 66 (2023),…

In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…

Combinatorics · Mathematics 2025-11-27 Dragan Mašulović

A general method for constructing a new class of topological Ramsey spaces is presented. Members of such spaces are infinite sequences of products of Fra\"iss\'e classes of finite relational structures satisfying the Ramsey property. The…

Logic · Mathematics 2015-10-20 Natasha Dobrinen , Jose G. Mijares , Timothy Trujillo

In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language $\Omega$. We think of unary algebras as $M$-sets where $M =…

Combinatorics · Mathematics 2024-05-17 Dragan Mašulović

Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…

Logic · Mathematics 2007-05-23 Fredrik Engström
‹ Prev 1 8 9 10 Next ›