English
Related papers

Related papers: Continuous logic in a classical setting

200 papers

With the aim of developing the concepts of positive logic and in response to a question that was asked by Poizat in one of his articles, I wrote this article. The main topic is the study of compactness in the extension as a compact…

Logic · Mathematics 2018-12-24 Mohammed Belkasmi

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, considering a classical…

Logic in Computer Science · Computer Science 2023-07-24 Eben Blaisdell , Max I. Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

We consider an abstract mixed variational problem governed by a nonlinear operator $A$ and a bifunctional $J$, in a real reflexive Banach space $X$. The operator $A$ is assumed to be continuous, Lipschitz continuous on each bounded subset…

Optimization and Control · Mathematics 2019-12-11 Andaluzia Matei , Mircea Sofonea

If $K$ is a compact Hausdorff space so that the Banach lattice $C(K)$ is isometrically lattice isomorphic to a dual of some Banach lattice, then $C(K)$ can be decomposed as the $\ell^\infty$-direct sum of the carriers of a maximal singular…

Functional Analysis · Mathematics 2023-08-25 Walt van Amstel , Jan Harm van der Walt

We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…

Logic · Mathematics 2013-04-17 Pietro Galliani , Miika Hannula , Juha Kontinen

We use the compactness theorem of continuous logic to give a new proof that $L^r([0,1]; \mathbb{R})$ isometrically embeds into $L^p([0,1]; \mathbb{R})$ whenever $1 \leq p \leq r \leq 2$. We will also give a proof for the complex case. This…

Logic · Mathematics 2019-01-03 Timothy H. McNicholl

We suggest an ordering for the predicates in continuous logic so that the semantics of continuous logic can be formulated as a hyperdoctrine. We show that this hyperdoctrine can be embedded into the hyperdoctrine of subobjects of a suitable…

Logic · Mathematics 2021-07-23 Daniel Figueroa , Benno van den Berg

We consider *-linear maps into a commutative C*-algebra C (X) of continuous functions on a locally compact Hausdorff space X with certain specified properties and prove two results: (1) an extension result for a class of *-linear maps Y -->…

Functional Analysis · Mathematics 2013-07-24 Ulrich Haag

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

The theory of M-ideals and multiplier mappings of Banach spaces naturally generalizes to left (or right) M-ideals and multiplier mappings of operator spaces. These subspaces and mappings are intrinsically characterized in terms of the…

Operator Algebras · Mathematics 2007-05-23 David P. Blecher , Edward G. Effros , Vrej Zarikian

We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…

Logic in Computer Science · Computer Science 2008-03-20 Tobias Ganzow , Sasha Rubin

An analog of Nadel's effective bound for the continuous Scott rank of metric structures, developed by Ben Yaacov, Doucha, Nies, and Tsankov, will be established: Let $\mathscr{L}$ be a language of continuous logic with code…

Logic · Mathematics 2019-08-02 William Chan , Ruiyuan Chen

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

Logic in Computer Science · Computer Science 2021-07-06 Bharat Adsul , Saptarshi Sarkar , A. V. Sreejith

This paper develops a {\em qualitative} and logic-based notion of similarity from the ground up using only elementary concepts of first-order logic centered around the fundamental model-theoretic notion of type.

Logic in Computer Science · Computer Science 2023-05-02 Christian Antić

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Quantum Physics · Physics 2014-12-31 Yoshihiro Maruyama

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

This paper investigates the notion of compact R-continuity and its specifications for set-valued mappings between Banach spaces. We reveal several important properties of compact R-continuity in general settings and show that in finite…

Optimization and Control · Mathematics 2025-09-05 Ba Khiet Le , Boris S. Mordukhovich , Michel A. Thera

Inquisitive logic is a research program that extends the scope of logic to cover not only statements, but also questions. In the context of this program, a logic that plays a prominent role is inquisitive first-order logic, InqBQ, which…

Logic · Mathematics 2026-03-24 Ivano Ciardelli , Juha Kontinen

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

We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…

Logic · Mathematics 2016-07-12 Łukasz Czajka