BELIEF REVISION IN NON-CLASSICAL LOGICS

2008 ◽  
Vol 1 (3) ◽  
pp. 267-304 ◽  
Author(s):  
DOV GABBAY ◽  
ODINALDO RODRIGUES ◽  
ALESSANDRA RUSSO
Keyword(s):  
Modal Logic ◽  
Belief Revision ◽  
Classical Logic ◽  
Revision Theory ◽  
Revision Operation ◽  
First Order ◽  
General Methodology ◽  
Definition Of

In this article, we propose a belief revision approach for families of (non-classical) logics whose semantics are first-order axiomatisable. Given any such (non-classical) logic $L$, the approach enables the definition of belief revision operators for $L$, in terms of a belief revision operation satisfying the postulates for revision theory proposed by Alchourrón, Gärdenfors and Makinson (AGM revision, Alchourrón et al. (1985)). The approach is illustrated by considering the modal logic K, Belnap's four-valued logic, and Łukasiewicz's many-valued logic. In addition, we present a general methodology to translate algebraic logics into classical logic. For the examples provided, we analyse in what circumstances the properties of the AGM revision are preserved and discuss the advantages of the approach from both theoretical and practical viewpoints.

scholarly journals Formula size games for modal logic and μ-calculus

2019 ◽  
Vol 29 (8) ◽  
pp. 1311-1344 ◽  
Author(s):  
Lauri T Hella ◽  
Miikka S Vilander
Keyword(s):  
Modal Logic ◽  
Optimal Strategy ◽  
Order Logic ◽  
First Order Logic ◽  
Kripke Models ◽  
First Order ◽  
Modal Operators ◽  
Crucial Difference ◽  
Definition Of ◽  
Person Game

Abstract We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler–Immerman game. However, due to a crucial difference in the definition of positions of the game, its winning condition is simpler, and the second player does not have a trivial optimal strategy. Thus, unlike the Adler–Immerman game, our game is a genuine two-person game. We illustrate the use of the game by proving a non-elementary succinctness gap between bisimulation invariant first-order logic $\textrm{FO}$ and (basic) modal logic $\textrm{ML}$. We also present a version of the game for the modal $\mu $-calculus $\textrm{L}_\mu $ and show that $\textrm{FO}$ is also non-elementarily more succinct than $\textrm{L}_\mu $.

scholarly journals Neighbourhood semantics for graded modal logic

2021 ◽  
Author(s):  
Jinsheng Chen ◽  
Hans Van Ditmarsch ◽  
Giuseppe Greco ◽  
Apostolos Tzimoulis
Keyword(s):  
Modal Logic ◽  
First Order ◽  
Kripke Frames ◽  
Definition Of

We introduce a class of neighbourhood frames for graded modal logic using an operation from Kripke frames to neighbourhood frames. This class of neighbourhood frames is shown to be first-order definable but not modally definable. We also obtain a new definition of graded bisimulation by modifying the definition of monotonic bisimulation.  

Undecidability of modal and intermediate first-order logics with two individual variables

1993 ◽  
Vol 58 (3) ◽  
pp. 800-823 ◽  
Author(s):  
D. M. Gabbay ◽  
V. B. Shehtman
Keyword(s):  
Modal Logic ◽  
Classical Logic ◽  
Predicate Calculus ◽  
Single Individual ◽  
First Order ◽  
Short Summary ◽  
Binary Predicate ◽  
Individual Variables ◽  
Image Position ◽  
Classical Predicate

The interest in fragments of predicate logics is motivated by the well-known fact that full classical predicate calculus is undecidable (cf. Church [1936]). So it is desirable to find decidable fragments which are in some sense “maximal”, i.e., which become undecidable if they are “slightly” extended. Or, alternatively, we can look for “minimal” undecidable fragments and try to identify the vague boundary between decidability and undecidability. A great deal of work in this area concerning mainly classical logic has been done since the thirties. We will not give a complete review of decidability and undecidability results in classical logic, referring the reader to existing monographs (cf. Suranyi [1959], Lewis [1979], and Dreben, Goldfarb [1979]). A short summary can also be found in the well-known book Church [1956]. Let us recall only several facts. Herein we will consider only logics without functional symbols, constants, and equality.(C1) The fragment of the classical logic with only monadic predicate letters is decidable (cf. Behmann [1922]).(C2) The fragment of the classical logic with a single binary predicate letter is undecidable. (This is a consequence of Gödel [1933].)(C3) The fragment of the classical logic with a single individual variable is decidable; in fact it is equivalent to Lewis S5 (cf. Wajsberg [1933]).(C4) The fragment of the classical logic with two individual variables is decidable (Segerberg [1973] contains a proof using modal logic; Scott [1962] and Mortimer [1975] give traditional proofs.)(C5) The fragment of the classical logic with three individual variables and binary predicate letters is undecidable (cf. Surańyi [1943]). In fact this paper considers formulas of the following typeφ,ψ being quantifier-free and the set of binary predicate letters which can appear in φ or ψ being fixed and finite.

scholarly journals Pretopologies and completeness proofs

1995 ◽  
Vol 60 (3) ◽  
pp. 861-878 ◽  
Author(s):  
Giovanni Sambin
Keyword(s):  
Classical Logic ◽  
Sequent Calculus ◽  
Predicate Logic ◽  
Linear Logic ◽  
Double Negation ◽  
Open Problems ◽  
Completeness Proof ◽  
Structural Rules ◽  
First Order ◽  
Definition Of

Pretopologies were introduced in [S], and there shown to give a complete semantics for a propositional sequent calculus BL, here called basic linear logic, as well as for its extensions by structural rules, ex falso quodlibet or double negation. Immediately after Logic Colloquium '88, a conversation with Per Martin-Löf helped me to see how the pretopology semantics should be extended to predicate logic; the result now is a simple and fully constructive completeness proof for first order BL and virtually all its extensions, including the usual, or structured, intuitionistic and classical logic. Such a proof clearly illustrates the fact that stronger set-theoretic principles and classical metalogic are necessary only when completeness is sought with respect to a special class of models, such as the usual two-valued models.To make the paper self-contained, I briefly review in §1 the definition of pretopologies; §2 deals with syntax and §3 with semantics. The completeness proof in §4, though similar in structure, is sensibly simpler than that in [S], and this is why it is given in detail. In §5 it is shown how little is needed to obtain completeness for extensions of BL in the same language. Finally, in §6 connections with proofs with respect to more traditional semantics are briefly investigated, and some open problems are put forward.

scholarly journals SOLOVAY-TYPE THEOREMS FOR CIRCULAR DEFINITIONS

2015 ◽  
Vol 8 (3) ◽  
pp. 467-487 ◽  
Author(s):  
SHAWN STANDEFER
Keyword(s):  
Modal Logic ◽  
Special Class ◽  
Completeness Theorem ◽  
Proof System ◽  
Revision Theory ◽  
First Order ◽  
Circular Definitions ◽  
Order Case ◽  
Unary Operator

AbstractWe present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our proof to a special class of circular definitions as well as to the first-order case.

scholarly journals Off-Shell Noether Currents and Potentials for First-Order General Relativity

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 348
Author(s):  
Merced Montesinos ◽  
Diego Gonzalez ◽  
Rodrigo Romero ◽  
Mariano Celada
Keyword(s):  
General Relativity ◽  
Vector Fields ◽  
Killing Vector ◽  
Spherically Symmetric ◽  
Killing Vector Fields ◽  
Arbitrary Vector ◽  
Four Dimensions ◽  
First Order ◽  
Direct Form ◽  
Definition Of

We report off-shell Noether currents obtained from off-shell Noether potentials for first-order general relativity described by n-dimensional Palatini and Holst Lagrangians including the cosmological constant. These off-shell currents and potentials are achieved by using the corresponding Lagrangian and the off-shell Noether identities satisfied by diffeomorphisms generated by arbitrary vector fields, local SO(n) or SO(n−1,1) transformations, ‘improved diffeomorphisms’, and the ‘generalization of local translations’ of the orthonormal frame and the connection. A remarkable aspect of our approach is that we do not use Noether’s theorem in its direct form. By construction, the currents are off-shell conserved and lead naturally to the definition of off-shell Noether charges. We also study what we call the ‘half off-shell’ case for both Palatini and Holst Lagrangians. In particular, we find that the resulting diffeomorphism and local SO(3,1) or SO(4) off-shell Noether currents and potentials for the Holst Lagrangian generically depend on the Immirzi parameter, which holds even in the ‘half off-shell’ and on-shell cases. We also study Killing vector fields in the ‘half off-shell’ and on-shell cases. The current theoretical framework is illustrated for the ‘half off-shell’ case in static spherically symmetric and Friedmann–Lemaitre–Robertson–Walker spacetimes in four dimensions.

scholarly journals Solving puzzles in deformed JT gravity: phase transitions and non-perturbative effects

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Clifford V. Johnson ◽  
Felipe Rosso
Keyword(s):  
Phase Structure ◽  
Scalar Potential ◽  
String Equation ◽  
Two Dimensional ◽  
Leading Order ◽  
Classical Analysis ◽  
First Order ◽  
First Order Phase Transition ◽  
Definition Of ◽  
First Order Phase

Abstract Recent work has shown that certain deformations of the scalar potential in Jackiw-Teitelboim gravity can be written as double-scaled matrix models. However, some of the deformations exhibit an apparent breakdown of unitarity in the form of a negative spectral density at disc order. We show here that the source of the problem is the presence of a multi-valued solution of the leading order matrix model string equation. While for a class of deformations we fix the problem by identifying a first order phase transition, for others we show that the theory is both perturbatively and non-perturbatively inconsistent. Aspects of the phase structure of the deformations are mapped out, using methods known to supply a non-perturbative definition of undeformed JT gravity. Some features are in qualitative agreement with a semi-classical analysis of the phase structure of two-dimensional black holes in these deformed theories.

scholarly journals Macroscopic degeneracy and order in the 3D plaquette Ising model

2015 ◽  
Vol 29 (20) ◽  
pp. 1550109 ◽  
Author(s):  
Desmond A. Johnston ◽  
Marco Mueller ◽  
Wolfhard Janke
Keyword(s):  
Low Temperature ◽  
Magnetic Order ◽  
Finite Size ◽  
Temperature Phase ◽  
Finite Size Scaling ◽  
First Order ◽  
Magnetic Order Parameter ◽  
First Order Transition ◽  
Definition Of ◽  
Low Temperature Phase

The purely plaquette 3D Ising Hamiltonian with the spins living at the vertices of a cubic lattice displays several interesting features. The symmetries of the model lead to a macroscopic degeneracy of the low-temperature phase and prevent the definition of a standard magnetic order parameter. Consideration of the strongly anisotropic limit of the model suggests that a layered, “fuki-nuke” order still exists and we confirm this with multi-canonical simulations. The macroscopic degeneracy of the low-temperature phase also changes the finite-size scaling corrections at the first-order transition in the model and we see this must be taken into account when analyzing our measurements.

scholarly journals The Modal Logic of Bayesian Belief Revision

2018 ◽  
Vol 48 (5) ◽  
pp. 809-824 ◽  
Author(s):  
William Brown ◽  
Zalán Gyenis ◽  
Miklós Rédei
Keyword(s):  
Modal Logic ◽  
Belief Revision
Sign in / Sign up

Export Citation Format

Share Document