English
Related papers

Related papers: Omitting types for infinitary [0, 1]-valued logic

200 papers

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 consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

Classes of Banach spaces that are finitely, strongly finitely or elementary equivalent are introduced. On sets of these classes topologies are defined in such a way that sets of defined classes become compact totally disconnected…

Functional Analysis · Mathematics 2007-05-23 Eugene Tokarev

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

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…

Logic · Mathematics 2014-02-26 Tarek Sayed Ahmed

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Logic · Mathematics 2022-09-20 Petr Cintula , George Metcalfe , Naomi Tokuda

We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For $m>0$, let $\mathrm{L}_m$ be the logic defined by axiom $\lozenge^{m+1} p\to \lozenge p\vee p$. We construct filtrations for…

Logic · Mathematics 2025-06-16 Andrey Kudinov , Ilya Shapirovsky

We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for omega-languages: Sigma_2, FO^2, the intersection of FO^2 and Sigma_2, and Delta_2 (and…

Formal Languages and Automata Theory · Computer Science 2009-10-02 Volker Diekert , Manfred Kufleitner

We show that a natural, two sorted $\cL_{\omega_1,\omega}$ theory involving the modular $j$-function is categorical in all uncountable cardinaities. It is also shown that a slight weakening of the adelic Mumford-Tate conjecture for products…

Logic · Mathematics 2013-04-18 Adam Harris

We describe how properties of metric groups and of unitary representations of metric groups can be presented in continuous logic. In particular we find $L_{\omega_1 \omega}$-axiomatization of amenability. We also show that in the case of…

Logic · Mathematics 2023-03-15 Aleksander Ivanov

We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…

Logic in Computer Science · Computer Science 2019-03-14 Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski

We present an adaptation of continuous first order logic to unbounded metric structures. This has the advantage of being closer in spirit to C. Ward Henson's logic for Banach space structures than the unit ball approach (which has been the…

Logic · Mathematics 2010-04-22 Itaï Ben Yaacov

By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…

Logic · Mathematics 2024-08-23 Seyed-Mohammad Bagheri

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

Logic · Mathematics 2017-10-18 Nathanael Ackerman , Cameron Freer , Rehana Patel

We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is…

Logic · Mathematics 2010-08-05 Chris Heunen

Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express metric constraints. A seminal result of Hirshfeld and Rabinovich shows that over the…

Logic in Computer Science · Computer Science 2013-02-19 Paul Hunter , Joël Ouaknine , James Worrell

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

The classical Baldwin-Lachlan characterization of uncountably categorical theories is known to fail in continuous logic in that not every inseparably categorical theory has a strongly minimal set. Here we investigate these issues by…

Logic · Mathematics 2022-08-12 James Hanson