English
Related papers

Related papers: Goldblatt-Thomason Theorems for Modal Intuitionist…

200 papers

We find an order-theoretic characterization of the Lindenbaum algebra of intuitionistic propositional logic in n variables.

Logic · Mathematics 2007-05-23 Michael O'Connor

In this paper we provide a unifying description of different types of semantics of modal logic found in the literature via the framework of topological categories. In the style of categorical logic, we establish an exact correspondence…

Category Theory · Mathematics 2023-08-01 Lingyuan Ye

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…

Logic in Computer Science · Computer Science 2023-06-16 Oliver Görlitz , Daniel Hausmann , Merlin Humml , Dirk Pattinson , Simon Prucker , Lutz Schröder

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

Logic in Computer Science · Computer Science 2023-06-22 Simon Docherty , David Pym

In this note, we prove that intuitionistic modal logic LIK4 is decidable.

Logic in Computer Science · Computer Science 2025-12-05 Philippe Balbiani , Çigdem Gencer , Tinko Tinchev

I aim to promote an alternative agenda for teaching modal logic chiefly inspired by the relationships between modal logic and philosophy. The guiding idea for this proposal is a reappraisal of the interest of modal logic in philosophy,…

History and Overview · Mathematics 2015-07-19 Luis Urtubey

We define proper, free and commuting partial actions on upper semicontinuous bundles of $C^*-$algebras. With such, we construct the $C^*-$algebra induced by a partial action and a partial actions on that algebra. Using those action we give…

Operator Algebras · Mathematics 2012-09-20 Damián Ferraro

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Kurt G\"odel (1932), and it is proved by Stanis{\l}aw Ja\'skowski (1936) to be a countably many valued logic. In this paper, we provide alternative proofs…

Logic · Mathematics 2021-11-30 Saeed Salehi

We derive a Prolog theorem prover for an Intuitionistic Epistemic Logic by starting from the sequent calculus {\bf G4IP} that we extend with operator definitions providing an embedding in intuitionistic propositional logic ({\bf IPC}). With…

Logic in Computer Science · Computer Science 2019-09-17 Paul Tarau

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path…

Logic in Computer Science · Computer Science 2023-06-16 Tim Lyon , Alwen Tiu , Rajeev Goré , Ranald Clouston

Following A. Kuznetsov's outline, we restore Kuznetsov's syntactic proof of the assertoric equipollence of the intuitionistic propositional calculus and the proof-intuitionistic calculus KM (Kuznetsov's Theorem). Then, we show that this…

Logic · Mathematics 2017-08-24 Alexei Muravitsky

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

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

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 propose a "modal linear logic" to reformulate intuitionistic modal logic S4 (IS4) in terms of linear logic, establishing an S4-version of Girard translation from IS4 to it. While the Girard translation from intuitionistic logic to linear…

Logic in Computer Science · Computer Science 2019-04-25 Yosuke Fukuda , Akira Yoshimizu

We compute the motivic Donaldson-Thomas theory of small crepant resolutions of toric Calabi-Yau 3-folds.

Algebraic Geometry · Mathematics 2016-01-20 Andrew Morrison , Kentaro Nagao

A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of modal logic S4. In…

Logic in Computer Science · Computer Science 2015-08-05 Steffen Lewitzka

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár