English
Related papers

Related papers: Esakia's theorem for the amended monadic intuition…

200 papers

In this article, we add a diamond to the parametrized box-based propositional language of intuitionistic doxastic logic and intuitionistic epistemic logic introduced by Artemov and Protopopescu. The main results of this article are the…

Logic in Computer Science · Computer Science 2025-09-17 Philippe Balbiani

In this paper we study intermediate logics between the degree preserving companion of Godel fuzzy logic with an involution and classical propositional logic CPL, as well as the intermediate logics of their finite-valued counterparts.…

Logic in Computer Science · Computer Science 2026-01-14 M. E. Coniglio , F. Esteva , J. Gispert , L. Godo

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…

Logic in Computer Science · Computer Science 2020-11-20 Aldo Figallo-Orellano , Juan Sebastian Slagter

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

Logic · Mathematics 2020-12-29 Christian Espíndola

In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…

Logic in Computer Science · Computer Science 2015-10-20 Steffen Lewitzka

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…

Logic · Mathematics 2009-05-05 Karim Nour , Abir Nour

For a prime number $p$ and a number field $k$, let $\tilde{k}$ be the compositum of all $\mathbb{Z}_p$-extensions of $k$. Greenberg's Generalized Conjecture (GGC) claims the pseudo-nullity of the unramified Iwasawa module $X(\tilde{k})$ of…

Number Theory · Mathematics 2016-11-01 Takenori Kataoka

The product m_k of the first k primes (2..p_k) has neighbours m_k +/- 1 with all prime divisors beyond p_k, implying there are infinitely many primes [Euclid]. All primes between p_k and m_k are in the group G_1 of units in semigroup…

General Mathematics · Mathematics 2009-10-08 N. F. Benschop

We investigate the computational complexity of admissibility of inference rules in infinite-valued {\L}ukasiewicz propositional logic (\L). It was shown in [13] that admissibility in {\L} is checkable in PSPACE. We establish that this…

Logic in Computer Science · Computer Science 2013-05-22 Emil Jeřábek

In a recent paper we showed that intuitionistic quantifiers admit the following temporal interpretation: "always in the future" (for $\forall$) and "sometime in the past" (for $\exists$). In this paper we study this interpretation for the…

Logic · Mathematics 2020-09-02 Guram Bezhanishvili , Luca Carai

Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…

Logic · Mathematics 2014-01-07 Tarek Sayed Ahmed

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose…

Logic · Mathematics 2017-03-01 Tomáš Kroupa , Bruno Teheux

This paper develops stable canonical rules for intuitionistic modal logics, which were first introduced for superintuitionistic logics and transitive nor mal modal logics in [1] and [2] respectively. We first prove that every in…

Logic · Mathematics 2026-02-11 Cheng Liao

In this article we introduce the variety of monadic BL-algebras as BL-algebras endowed with two monadic operators $\forall$ and $\exists$. After a study of the basic properties of this variety we show that this class is the equivalent…

In this paper we show that the intuitionistic monotone modal logic $\mathsf{iM}$ has the uniform Lyndon interpolation property (ULIP). The logic $\mathsf{iM}$ is a non-normal modal logic on an intuitionistic basis, and the property ULIP is…

Logic · Mathematics 2022-08-10 Amirhossein Akbar Tabatabai , Rosalie Iemhoff , Raheleh Jalali

We prove a version of the Gr\"atzer-Schmidt theorem for the Lindenbaum-Tarski algebra associated to the Implicational Propositional Calculus.

Rings and Algebras · Mathematics 2016-01-22 P. L. Robinson

In the style of Lindstr\"om's theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract logic satisfying a certain form of…

Logic · Mathematics 2021-04-08 Grigory Olkhovikov , Guillermo Badia

We show how our p-adic method to compute Galois representations occurring in the torsion of Jacobians of algebraic curves can be adapted to modular curves. The main ingredient is the use of "moduli-friendly" Eisenstein series introduced by…

Number Theory · Mathematics 2021-05-20 Nicolas Mascot

The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…

Logic in Computer Science · Computer Science 2013-09-05 Matteo Mio , Alex Simpson

We prove pointwise and maximal ergodic theorems for probability measure preserving (p.m.p.) actions of any countable group, provided it admits an essentially free, weakly mixing amenable action of stable type $III_1$. We show that this…

Dynamical Systems · Mathematics 2011-12-30 Lewis Bowen , Amos Nevo