English
Related papers

Related papers: Modal Logic With Non-deterministic Semantics: Part…

200 papers

This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…

Logic in Computer Science · Computer Science 2026-02-05 Paul Gorbow

By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly…

Logic · Mathematics 2023-07-11 Guillermo Badia , John Lane Bell

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 investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On the one hand, it is well-known that every first-order predicate modal logic complete with respect to…

Logic · Mathematics 2019-12-24 Mikhail Rybakov , Dmitry Shkatov

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Computational Complexity · Computer Science 2010-09-13 Michael Thomas , Heribert Vollmer

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke…

Logic in Computer Science · Computer Science 2015-07-01 François Laroussinie , Nicolas Markey

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter represents meaning as vectors in high-dimensional spaces shaped…

Logic · Mathematics 2026-02-04 Daniel Quigley

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

Logic · Mathematics 2025-09-03 Bahareh Afshari , Graham E. Leigh , Guillermo Menèndez Turata

Logic-based models can be used to build verification tools for machine learning classifiers employed in the legal field. ML classifiers predict the outcomes of new cases based on previous ones, thereby performing a form of case-based…

Artificial Intelligence · Computer Science 2025-10-16 Cecilia Di Florio , Huimin Dong , Antonino Rotolo

We determine the modal logic of fixed-point models of truth and their axiomatizations by Solomon Feferman via Solovay-style completeness results. Given a fixed-point model $\mathcal{M}$, or an axiomatization $S$ thereof, we find a modal…

Logic · Mathematics 2020-10-28 Carlo Nicolai , Johannes Stern

Aristotle's discussions on modal syllogistic have often been viewed as error-prone and have garnered significant attention in the literature due to historical and philosophical interests. However, from a contemporary standpoint, they also…

Artificial Intelligence · Computer Science 2023-07-12 Yipu Li , Yanjing Wang

We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and…

Logic · Mathematics 2022-10-19 Tiziano Dalmonte

We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…

Logic in Computer Science · Computer Science 2021-04-27 Simone Martini , Andrea Masini , Margherita Zorzi

Modal interpretations have the ambition to construe quantum mechanics as an objective, man-independent description of physical reality. Their second leading idea is probabilism: quantum mechanics does not completely fix physical reality but…

Quantum Physics · Physics 2007-05-23 Dennis Dieks

This work is divided between two main areas: in the theory of multialgebras, we focus mostly on a new definition of what a freely generated object should be in their category, and on how this category is equivalent to another with partially…

Logic · Mathematics 2022-06-23 Guilherme Vicentin de Toledo

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional…

Logic in Computer Science · Computer Science 2021-07-20 Vitor Greati , Sérgio Marcelino , João Marcos

The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…

Logic in Computer Science · Computer Science 2023-06-22 Miika Hannula

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…

Logic in Computer Science · Computer Science 2014-01-16 Meghyn Bienvenu