English
Related papers

Related papers: On Some Infinitary Logics

200 papers

Suppose lambda is a singular cardinal of uncountable cofinality kappa. For a model M of cardinality lambda, let No(M) denote the number of isomorphism types of models N of cardinality lambda which are L_{infty lambda}-equivalent to M. In…

Logic · Mathematics 2016-09-07 Saharon Shelah , Pauli Väisänen

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

Algebraic Topology · Mathematics 2016-01-20 Mark Grant , Gregory Lupton , John Oprea

We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…

Logic · Mathematics 2007-05-23 Mor Doron , Saharon Shelah

We consider model-theoretic properties related to the expressive power of three analogues of $L_{\omega_1, \omega}$ for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the…

Logic · Mathematics 2017-08-10 Christopher J. Eagle

We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…

Logic · Mathematics 2013-05-29 Assaf Hasson , Misha Gavrilovich

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…

Logic in Computer Science · Computer Science 2009-08-04 Olivier Finkel

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, we study a class of toposes with enough points, the $\kappa$-separable toposes. These are equivalent to sheaf toposes over a site with $\kappa$-small limits that has at…

Logic · Mathematics 2017-09-08 Christian Espíndola

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

Logic in Computer Science · Computer Science 2021-04-12 Miika Hannula , Minna Hirvonen , Juha Kontinen

We introduce infinitary action logic with exponentiation -- that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allows some of the structural rules…

Logic in Computer Science · Computer Science 2021-07-09 Stepan L. Kuznetsov , Stanislav O. Speranski

Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…

Logic in Computer Science · Computer Science 2007-05-23 Wei Li , Shilong Ma , Yuefei Sui , Ke Xu

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

Category Theory · Mathematics 2016-03-04 Darllan Conceição Pinto , Hugo Luiz Mariano

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…

Logic · Mathematics 2016-09-06 Moti Gitik , William Mitchell

We work in a first-order setting where structures are spread out over a metric space, with quantification allowed only over bounded subsets. Assuming a doubling property for the metric space, we define a canonical {\em core} $\mathcal{J}$…

Logic · Mathematics 2022-02-23 Ehud Hrushovski

Shelah has provided sufficient conditions for an $L_{\omega_1, \omega}$-sentence $\psi$ to have arbitrarily large models and for a Morley-like theorem to hold of $\psi$. These conditions involve structural and set-theoretic assumptions on…

Logic · Mathematics 2019-01-25 Marcos Mazari-Armida , Sebastien Vasey

In real Hilbert spaces, this paper generalizes the orthogonal groups $\mathrm{O}(n)$ in two ways. One way is by finite multiplications of a family of operators from reflections which results in a group denoted as $\Theta(\kappa)$, the other…

History and Overview · Mathematics 2016-12-28 Luo Jianwen

A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…

Logic · Mathematics 2019-11-22 R. Jansana , T. Moraschini

Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…

Logic · Mathematics 2026-05-08 Tapani Hyttinen , Joni Puljujärvi , Davide Emilio Quadrellaro

The deformations of the Galilei algebra and their associated noncommutative Newtonian spacetimes are investigated. This is done by analyzing the possible nonrelativistic limits of an eleven generator (pseudo)extended \kap-Poincar\'e algebra…

q-alg · Mathematics 2011-07-28 J. A. de Azcarraga , J. C. Perez Bueno

We perform canonical analysis of non-relativistic particle in Newton-Cartan Background. Then we extend this analysis to the case of non-relativistic superparticle in the same background. We determine constraints structure of this theory and…

High Energy Physics - Theory · Physics 2018-04-04 J. Kluson

The $\omega$-power of a finitary language L over a finite alphabet $\Sigma$ is the language of infinite words over $\Sigma$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$ $\omega$ | $\forall$i $\in$ $\omega$ w i $\in$ L}. The…

Logic in Computer Science · Computer Science 2020-07-20 Olivier Finkel , Dominique Lecomte