English
Related papers

Related papers: A Note on Nesting in Dyadic Deontic Logic

200 papers

This paper introduces higher-order (``nested") Kripke models, a generalization of Kripke models that is remarkably close to Kripke's original idea -- both mathematically and conceptually. Standard models are now $0$-ary models, whereas…

Logic in Computer Science · Computer Science 2026-05-07 Victor Barroso-Nascimento

Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $p\wedge\Diamond\neg p$ ('$p$, but it might be that not $p$') appears to be a…

Logic in Computer Science · Computer Science 2024-03-26 Wesley H. Holliday , Matthew Mandelkern

We study abstract versions of G\"odel's second incompleteness theorem and formulate generalizations of L\"ob's derivability conditions that work for logics weaker than the classical one. We isolate the role of contraction rule in G\"odel's…

Logic · Mathematics 2016-02-19 Lev Beklemishev , Daniyar Shamkanov

In this paper we consider an approach where both propositions and the accessibility relation are infinitely many-valued over G\"{o}del algebras. In particular, we consider separately the $\Box $-fragment and the $\Diamond $-fragment of our…

Logic · Mathematics 2009-03-17 Xavier Caicedo , Ricardo Oscar Rodriguez

We contribute the first denotational semantics of polymorphic dependent type theory extended by an equational theory for general (higher-order) reference types and recursive types, based on a combination of guarded recursion and…

Programming Languages · Computer Science 2023-04-13 Jonathan Sterling , Daniel Gratzer , Lars Birkedal

Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that…

Logic · Mathematics 2007-05-23 Wayne Aitken , Jeffrey A. Barrett

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

The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…

Logic · Mathematics 2020-08-13 Balthasar Grabmayr

Using an adelic approach we simultaneously consider real and p-adic aspects of dynamical systems whose states are mapped by linear fractional transformations isomorphic to some subgroups of GL (2, Q), SL (2, Q) and SL (2, Z) groups. In…

Mathematical Physics · Physics 2009-11-11 Branko Dragovich , Andrei Khrennikov , Dusan Mihajlovic

Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are discussed for different application domains like argumentation theory, legal reasoning, and acts in multi-agent…

Artificial Intelligence · Computer Science 2018-09-17 Ulrich Furbach , Claudia Schon , Frieder Stolzenburg

In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the…

Logic in Computer Science · Computer Science 2018-03-28 Martin Lück

A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…

Logic · Mathematics 2014-07-23 Alex Citkin

In this paper we prove soundness and completeness of some epistemic extensions of G\"odel fuzzy logic, based on Kripke models in which both propositions at each state and accessibility relations take values in [0,1]. We adopt belief as our…

Logic · Mathematics 2024-03-05 D. Dastgheib , H. Farahani , A. H. Sharafi

The unification problem in a normal modal logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. We shall say that a set of unifiers of a unifiable…

Logic in Computer Science · Computer Science 2019-02-12 Philippe Balbiani , Çiğdem Gencer

The primary theme of this investigation is a decision theoretic account of conditional ought statements (e.g., "You ought to do A, if C") that rectifies glaring deficiencies in classical deontic logic. The resulting account forms a sound…

Artificial Intelligence · Computer Science 2013-03-08 Judea Pearl

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning: modal systems in which cognitive contexts extend known facts with hypothetical assumptions in order to explore their consequences.…

Logic in Computer Science · Computer Science 2026-03-24 Fabio Vitali

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

Logic in Computer Science · Computer Science 2020-06-17 Harley Eades , Dominic Orchard

We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we…

Logic · Mathematics 2025-12-01 Marta Bílková , Thomas M. Ferguson , Daniil Kozhemiachenko

In this paper, we introduce and investigate monadic NM-algebras: a variety of NM-algebras equipped with universal quantifiers. Also, we obtain some conditions under which monadic NM-algebras become monadic Boolean algebras. Besides, we show…

Logic · Mathematics 2017-09-15 Jun Tao Wang , Xiao Long Xin , Peng Fei He