English
Related papers

Related papers: Continuous logic in a classical setting

200 papers

The formal construction of the second-order logic or predicate calculus essentially adds quantifiers to propositional logic. Why second-order logic cannot be reduced to that of the first order? How to demonstrate that certain predicates are…

Logic · Mathematics 2012-02-16 Hector Zenil

We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…

Logic · Mathematics 2021-09-07 Nicholas Pischke

We present a multi-modal action logic with first-order modalities, which contain terms which can be unified with the terms inside the subsequent formulas and which can be quantified. This makes it possible to handle simultaneously time and…

Artificial Intelligence · Computer Science 2007-05-23 Camilla Schwind

We attach to each weak model category $\mathcal{M}$ a class of first order formulas about the fibrant objects of $\mathcal{M}$ whose validity is invariant under homotopies and weak equivalences. This is a generalization of the classical…

Category Theory · Mathematics 2025-10-06 César Bardomiano Martínez , Simon Henry

We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed…

Artificial Intelligence · Computer Science 2019-06-25 Vaishak Belle , Brendan Juba

The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…

Logic · Mathematics 2018-08-14 Philip Welch

The classical duality theory of Kantorovich and Kellerer for the classical optimal transport is generalized to an abstract framework and a characterization of the dual elements is provided. This abstract generalization is set in a Banach…

Functional Analysis · Mathematics 2017-10-25 Ibrahim Ekren , H. Mete Soner

Formal theories of arithmetic have traditionally been based on either classical or intuitionistic logic, leading to the development of Peano and Heyting arithmetic, respectively. We propose to use $\mu$MALL as a formal theory of arithmetic…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Manighetti , Dale Miller

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

Logic · Mathematics 2023-06-27 James Hanson

Separately continuous bihomomorphisms on a product of convergence or topological groups occur with great frequency. Of course, in general, these need not be jointly continuous. In this paper, we exhibit some results of Banach-Steinhaus type…

Functional Analysis · Mathematics 2008-05-20 R. Beattie , H. -P. Butzmann

Extending the classical notion of the spreading model, the $k$-spreading models of a Banach space are introduced, for every $k\in\mathbb{N}$. The definition, which is based on the $k$-sequences and plegma families, reveals a new class of…

Functional Analysis · Mathematics 2011-05-16 S. A. Argyros , V. Kanellopoulos , K. Tyros

The notions of compactness and Hausdorff separation for generalized enriched categories allow us, as classically done for the category $\mathsf{Top}$ of topological spaces and continuous functions, to study $\textit{compactly generated…

Category Theory · Mathematics 2019-08-13 Willian Ribeiro

This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…

Logic in Computer Science · Computer Science 2018-12-03 Ioana Leustean , Natalia Moanga , Traian Florin Serbanuta

Let $X_1, \ldots, X_m$ be Banach spaces and let $E_1, \ldots, E_m,F$ be Banach lattices. Our main results read as follows: (i) The linear adjoint $A^*$ of a continuous multilinear operator $A \colon X_1 \times \cdots \times X_m \to F$ is…

Functional Analysis · Mathematics 2025-12-10 Geraldo Botelho , Ariel Monção

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on…

Logic · Mathematics 2019-01-08 Guillermo Badia , Vicent Costa , Pilar Dellunde , Carles Noguera

We extend Yosida's 1941 version of Stone-Gelfand duality to metrically complete unital lattice-ordered groups that are no longer required to be real vector spaces. This calls for a generalised notion of compact Hausdorff space whose points…

Functional Analysis · Mathematics 2024-11-27 Marco Abbadini , Vincenzo Marra , Luca Spada

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 define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jouko Väänänen

We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…

Logic in Computer Science · Computer Science 2025-04-07 Silvio Ghilardi , Jérémie Marquès