English
Related papers

Related papers: Continuous logic in a classical setting

200 papers

Let $T:Y\to X$ be a bounded linear operator between two normed spaces. We characterize compactness of $T$ in terms of differentiability of the Lipschitz functions defined on $X$ with values in another normed space $Z$. Furthermore, using a…

Functional Analysis · Mathematics 2019-10-17 Mohammed Bachir , Gonzalo Flores , Sebastián Tapia-García

For a locally compact group $G$, we show that it is possible to present the class of continuous unitary representations of $G$ as an elementary class of metric structures, in the sense of continuous logic. More precisely, we show how…

Classical Analysis and ODEs · Mathematics 2021-11-05 Itaï Ben Yaacov , Isaac Goldbring

The objective of this paper is to introduce and study a complicated nonlinear system, called coupled variational-hemivariational inequalities, which is described by a highly nonlinear coupled system of inequalities on Banach spaces. We…

Analysis of PDEs · Mathematics 2023-09-12 YR. Bai , S. Migorski , VT. Nguyen , JW. Peng

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Logic · Mathematics 2022-07-18 Reijo Jaakkola , Antti Kuusisto

We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…

Category Theory · Mathematics 2016-03-29 Caio de Andrade Mendes , Hugo Luiz Mariano

Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…

Programming Languages · Computer Science 2020-02-21 Gilles Barthe , Raphaëlle Crubillé , Ugo Dal Lago , Francesco Gavazzo

We investigate an enriched-categorical approach to a field of discrete mathematics. The main result is a duality theorem between a class of enriched categories (called $\overline{\mathbb{Z}}$- or $\overline{\mathbb{R}}$-categories) and that…

Category Theory · Mathematics 2019-04-19 Soichiro Fujii

Classical first-order logic is in many ways central to work in mathematics, linguistics, computer science and artificial intelligence, so it is worthwhile to define it in full detail. We present soundness and completeness proofs of a…

Logic in Computer Science · Computer Science 2020-03-02 Asta Halkjær From , Alexander Birch Jensen , Anders Schlichtkrull , Jørgen Villadsen

We define a class of spaces on which one may generalise the notion of compactness following motivating examples from higher-dimensional number theory. We establish analogues of several well-known topological results (such as Tychonoff's…

General Topology · Mathematics 2019-02-11 Raven Waller

Many classical planning frameworks are built on first-order languages. The first-order expressive power is desirable for compactly representing actions via schemas, and for specifying quantified conditions such as $\neg\exists…

Logic in Computer Science · Computer Science 2020-06-04 Andrés Occhipinti Liberman , Andreas Achen , Rasmus Kræmmer Rendsvig

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

Logic in Computer Science · Computer Science 2014-12-11 Fred Mesnard , Etienne Payet

Let $\A$ be a Banach algebra with unity $\textbf{1}$ and $ \M $ be a unital Banach left $ \A $-module. let $ \delta: \A \rightarrow \M$ be a continuous linear map with the property that \[ a,b\in \A, \quad ab+ba=z \Rightarrow…

Operator Algebras · Mathematics 2014-01-03 B. Fadaee , H. Ghahramani

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

Logic in Computer Science · Computer Science 2012-05-23 Andreas Krebs , Howard Straubing

Let $X$ and $Y$ be compact Hausdorff spaces, and let $C(X)$ and $C(Y)$ denote the commutative Banach algebras of all continuous complex-valued functions on $X$ and $Y$, respectively. We study bijective maps $T$ from $C(X)$ onto $C(Y)$ which…

Functional Analysis · Mathematics 2026-01-19 T. Miura , T. Takahashi

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…

Formal Languages and Automata Theory · Computer Science 2009-03-09 Mikolaj Bojanczyk

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

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

In this paper we provide some new sufficient conditions that ensure the existence of the solution of a weak vector equilibrium problem in Hausdorff topological vector spaces ordered by a cone. Further, we introduce a dual problem and we…

Functional Analysis · Mathematics 2017-04-25 Szilárd László

Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…

Category Theory · Mathematics 2008-02-06 Claudio Pisani

A strictly formal, set-theoretical treatment of classical first-order logic is given. Since this is done with the goal of a concrete Mizar formalization of basic results (Lindenbaum lemma; Henkin, satisfiability, completeness and…

Logic · Mathematics 2012-05-22 Marco B. Caminati