English
Related papers

Related papers: A Topological Completeness Theorem for Transfinite…

200 papers

We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then…

Logic · Mathematics 2024-08-12 Diego Castaño , José Patricio Díaz Varela , Gabriel Savoy

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

We study some closely interrelated notions of Homological Algebra: (1) We define a topology on modules over a not-necessarily commutative ring $R$ that coincides with the $R$-topology defined by Matlis when $R$ is commutative. (2) We…

Rings and Algebras · Mathematics 2018-08-08 Alberto Facchini , Zahra Nazemian

A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…

Logic · Mathematics 2016-04-13 Benjamin G. Rin , Sean Walsh

We prove the following version of the first incompleteness theorem that simultaneously strengthens Mostowski's theorem and Vaught's theorem: For any c.e. family $\{ T_i \}_{i \in \omega}$ of consistent extensions of Tarski, Mostowski and…

Logic · Mathematics 2023-08-15 Taishi Kurahashi

Motivated by recent works on the genus of classifying spaces of compact Lie groups, here we study the set of filtered $\lambda$-ring structures over a filtered ring from a purely algebraic point of view. From a global perspective, we first…

Algebraic Topology · Mathematics 2007-05-23 Donald Yau

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

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

Logic in Computer Science · Computer Science 2013-01-07 Zhaohua Luo

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

We study the topological models of a logic of knowledge for topological reasoning, introduced by Larry Moss and Rohit Parikh. Among our results is a solution of a conjecture by the formentioned authors, finite satisfiability property and…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…

Logic · Mathematics 2016-05-19 Tuomas A. Hakoniemi , Joost J. Joosten

We derive an intuitionistic version of G\"odel-L\"ob modal logic ($\sf{GL}$) in the style of Simpson, via proof theoretic techniques. We recover a labelled system, $\sf{\ell IGL}$, by restricting a non-wellfounded labelled system for…

Logic in Computer Science · Computer Science 2023-09-04 Anupam Das , Iris van der Giessen , Sonia Marin

We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfMT), a recently introduced extension of LTL over finite traces (LTLf) where propositions are replaced by first-order formulas and where first-order variables referring…

Artificial Intelligence · Computer Science 2023-08-01 Luca Geatti , Alessandro Gianola , Nicola Gigante , Sarah Winkler

Given a compact interval $I \subseteq \mathbb{R}$, and a function $f$ that is a product of a nonzero polynomial with a Gaussian, it will be shown that the translates $\{ f(\cdot - \lambda) : \lambda \in \Lambda \}$ are complete in $C(I)$ if…

Classical Analysis and ODEs · Mathematics 2024-10-02 Lukas Liehr

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Logic · Mathematics 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…

Logic in Computer Science · Computer Science 2007-05-23 Patrick Baillot , Paolo Coppola , Ugo Dal Lago

We study expansions of Hilbert spaces with a bounded normal operator $T$. We axiomatize this theory in a natural language and identify all of its completions. We prove the definability of the adjoint $T^*$ and prove quantifier elimination…

Logic · Mathematics 2025-07-30 Alexander Berenstein , Nicolás Cuervo Ovalle , Isaac Goldbring

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

We use Kan injectivity to axiomatise concepts in the 2-category of topoi. We showcase the expressivity of this language through many examples, and we establish some aspects of the formal theory of Kan extension in this 2-category (pointwise…

Logic · Mathematics 2025-05-22 Ivan Di Liberti , Lingyuan Ye

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn
‹ Prev 1 8 9 10 Next ›