English
Related papers

Related papers: Topological completeness of logics above S4

200 papers

We investigate modal logical aspects of provability predicates $\mathrm{Pr}_T(x)$ satisfying the following condition: $\mathbf{M}$: If $T \vdash \varphi \to \psi$, then $T \vdash \mathrm{Pr}_T(\ulcorner \varphi \urcorner) \to…

Logic · Mathematics 2023-04-04 Haruka Kogure , Taishi Kurahashi

It is customary to expect from a logical system that it can be algebraizable, in the sense that an algebraic companion of the deductive machinery can always be found. Since the inception of da Costa's paraconsistent calculi $C_n$, algebraic…

Logic · Mathematics 2021-05-24 Walter Carnielli , Marcelo E. Coniglio , David Fuenmayor

(Pre)closure spaces are a generalization of topological spaces covering also the notion of neighbourhood in discrete structures, widely used to model and reason about spatial aspects of distributed systems. In this paper we introduce an…

Logic in Computer Science · Computer Science 2021-01-01 Davide Castelnovo , Marino Miculan

Topological Spatial Model Checking is a recent paradigm where model checking techniques are developed for the topological interpretation of Modal Logic. The Spatial Logic of Closure Spaces, SLCS, extends Modal Logic with reachability…

Logic in Computer Science · Computer Science 2023-06-22 Nick Bezhanishvili , Vincenzo Ciancia , David Gabelaia , Gianluca Grilletti , Diego Latella , Mieke Massink

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…

Logic · Mathematics 2023-06-05 Colin Bloomfield , Yoshihiro Maruyama

Denote by (R,.) the multiplicative semigroup of an associative algebra R over an infinite field, and let (R,*) represent R when viewed as a semigroup via the circle operation x*y=x+y+xy. In this paper we characterize the existence of an…

Rings and Algebras · Mathematics 2007-05-23 David M. Riley , Mark C. Wilson

We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…

Logic in Computer Science · Computer Science 2025-10-31 Michael Benedikt , Chia-Hsuan Lu , Tony Tan

Let $S$ be an integral domain with field of fractions $F$ and let $A$ be an $F$-algebra. An $S$-subalgebra $R$ of $A$ is called $S$-nice if $R$ is lying over $S$ and the localization of $R$ with respect to $S \setminus \{ 0 \}$ is $A$. Let…

Rings and Algebras · Mathematics 2019-04-23 Shai Sarussi

It is well known that we can use structural proof theory to refine, or generalize, existing paradigmatic computational primitives, or to discover new ones. Under such a point of view we keep developing a programme whose goal is establishing…

Logic in Computer Science · Computer Science 2012-12-20 Luca Roversi

We introduce a multi-sorted stratified syllogistic, called 4LQSR, admitting variables of four sorts and a restricted form of quantification over variables of the first three sorts, and prove that it has a solvable satisfiability problem by…

Logic in Computer Science · Computer Science 2012-09-11 Domenico Cantone , Marianna Nicolosi Asmundo

A topological space is totally paracompact if any base of this space contains a locally finite subcover. We focus on a problem of Curtis whether in the class of regular Lindel\"of spaces total paracompactness is equivalent to the Menger…

General Topology · Mathematics 2025-11-14 Davide Giacopello , Maddalena Bonanzinga , Piotr Szewczak

In this project, a rather complete proof-theoretical formalization of Lambek Calculus (non-associative with arbitrary extensions) has been ported from Coq proof assistent to HOL4 theorem prover, with some improvements and new theorems.…

Computation and Language · Computer Science 2017-05-23 Chun Tian

A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…

Computational Complexity · Computer Science 2015-06-02 Peter Jonsson , Johan Thapper

A new class of groups $\mathcal{C}$, containing all coherent RAAGs and all toral relatively hyperbolic groups, is defined. It is shown that, for a group $G$ in the class $\mathcal{C}$, the $\mathbb{Z}[t]$-exponential group…

Group Theory · Mathematics 2022-01-26 Montserrat Casals-Ruiz , Andrew Duncan , Ilya Kazachkov

A subalgebra $B$ of a Lie algebra $L$ is {\em c-supplemented} in $L$ if there is a subalgebra $C$ of $L$ with $L = B + C$ and $B \cap C \leq B_L$, where $B_L$ is the core of $B$ in $L$. This is analogous to the corresponding concept of a…

Rings and Algebras · Mathematics 2007-12-21 David A. Towers

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

In this paper I consider locally finite Lie algebras of characteristic zero satisfying the condition that for every finite number of elements $x_{1}, x_{2},..., x_{k}$ of such an algebra $L$ there is finite-dimensional subalgebra $A$ which…

Rings and Algebras · Mathematics 2007-05-23 L. A. Simonian

We call a subalgebra $U$ of a Lie algebra $L$ a $CAP$-subalgebra of $L$ if for any chief factor $H/K$ of $L$, we have $H \cap U = K \cap U$ or $H+U = K+U$. In this paper we investigate some properties of such subalgebras and obtain some…

Rings and Algebras · Mathematics 2014-09-11 David A. Towers

Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal…

Logic in Computer Science · Computer Science 2017-01-11 Carsten Lutz , Frank Wolter

We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Logic in Computer Science · Computer Science 2017-04-04 Andreas B. M. Brunner , Steffen Lewitzka
‹ Prev 1 8 9 10 Next ›