English
Related papers

Related papers: Stable Canonical Rules for Intuitionistic Modal Lo…

200 papers

We formulate a stable reduction conjecture that extends Deligne-Mumford's stable reduction to higher dimensions and provide a simple proof that it holds in large characteristic, assuming two standard conjectures of the Minimal Model…

Algebraic Geometry · Mathematics 2024-11-28 Tai-Hsuan Chung

In this paper we provide a first-ever epistemic formulation of stabilizing agreement, defined as the non-terminating variant of the well established consensus problem. In stabilizing agreements, agents are given (possibly different) initial…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-05 Giorgio Cignarale , Stephan Felber , Hugo Rincon Galeana

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Logic · Mathematics 2014-11-04 Danko Ilik

Our concern is the axiomatisation problem for modal and algebraic logics that correspond to various fragments of two-variable first-order logic with counting quantifiers. In particular, we consider modal products with Diff, the…

Logic in Computer Science · Computer Science 2020-02-04 Christopher Hampson , Stanislav Kikot , Agi Kurucz , Sergio Marcelino

It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…

Logic in Computer Science · Computer Science 2024-11-20 Tim S. Lyon , Ian Shillito , Alwen Tiu

We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Goedel-McKinsey-Tarski-Artemov definition of Intuitionistic Logic as…

Logic in Computer Science · Computer Science 2017-08-09 Simon Kramer

We present nested sequent systems for propositional G\"odel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these…

Logic in Computer Science · Computer Science 2024-06-07 Tim S. Lyon

Inclusion logic is a variant of dependence logic that was shown to have the same expressive power as positive greatest fixed-point logic. Inclusion logic is not axiomatizable in full, but its first-order consequences can be axiomatized. In…

Logic · Mathematics 2020-01-22 Fan Yang

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…

Logic in Computer Science · Computer Science 2024-11-26 Victoria Vollmer , Danielle Marshall , Harley Eades , Dominic Orchard

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

Restricted non-deterministic matrices (RNmatrices) impose constraints on the rows of non-deterministic matrices (Nmatrices), filtering out "unsound" rows and retaining only "valid" ones. This yields a more expressive framework than standard…

Logic in Computer Science · Computer Science 2026-05-07 Renato R. Leme , Carlos Olarte , Elaine Pimentel

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

This paper presents a novel concept of a Polyatomic Logic and initiates its systematic study. This approach, inspired by Inquisitive semantics, is obtained by taking a variant of a given logic, obtained by looking at the fragment covered by…

Logic · Mathematics 2023-03-28 Rodrigo Nicolau Almeida

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive…

Logic in Computer Science · Computer Science 2023-07-12 Peter Hawke

We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…

Logic in Computer Science · Computer Science 2023-06-22 G. A. Kavvos

In a 1985 commentary to his collected works, Kolmogorov remarked that his 1932 paper "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic logic] will become a permanent part of a [standard] course of…

Logic · Mathematics 2022-10-04 Sergey A. Melikhov

Standard epistemic logic studies propositional knowledge, yet many other types of knowledge such as "knowing whether", "knowing what", "knowing how" are frequently and widely used in everyday life as well as academic fields. In…

Logic in Computer Science · Computer Science 2016-11-28 Yifeng Ding

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

Logic in Computer Science · Computer Science 2020-02-19 Amelia Harrison , Vladimir Lifschitz , Miroslaw Truszczynski
‹ Prev 1 3 4 5 6 7 10 Next ›