Results 11 to 20 of about 210 (36)
Incompleteness of a first-order Gödel logic and some temporal logics of programs [PDF]
, 1996 It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant ...
Baaz, Matthias +2 more
core +2 more sources
Hidden modalities in algebras with negation and implication [PDF]
, 2013 Lukasiewicz 3-valued logic may be seen as a logic with hidden truthfunctional modalities de ned by A := :A ! A and A := :(A ! :A). It is known that axioms (K), (T), (B), (D), (S4), (S5) are provable for these modalities, and rule (RN) is admissible. We
Järvinen, Jouni +3 more
core +1 more source
Propositional dynamic logic for searching games with errors [PDF]
, 2014 We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of {\L}ukasiewicz many-valued logic.
Teheux, Bruno
core +2 more sources
The Lattice of Congruences of a Finite Line Frame [PDF]
, 2017 Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F.
Areces, Carlos +3 more
core +2 more sources
A note on ultraproducts of Veltman models [PDF]
, 2011 We consider ultraproducts of Veltman models, and show that a version of Łos theorem is ...
Mladen Vuković
core +2 more sources
Topo-Bisimulations are Coalgebraic [PDF]
, 2010 We show that the topological interpretation of the modal logic S4 can be reformulated using a special kind of coalgebras for the filter functor. Thus the topological semantics is subsumed in coalgebraic semantics.
Schubert, Christoph
core +1 more source
Canonical varieties with no canonical axiomatisation
, 2005 Accepted ...
Hodkinson, I, Venema, Y
core +5 more sources
Almost structural completeness; an algebraic approach [PDF]
, 2014 A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e. rules that can
M. Stronkowski, Michał, Wojciech Dzik
core
A Note on the Coalgebraic Interpretation of Game Logic [PDF]
, 2010 We propose a coalgebraic interpretation of game logic, making the results of coalgebraic logic available for this context. We study some properties of a coalgebraic interpretation, showing among others that Aczel's Theorem on the characterization of ...
Doberkat, Ernst-Erich
core +1 more source
Sistemas multi–modales de profundidad restringida
Ingeniería y Ciencia, 2008 Se presentan como extensiones del cálculo proposicional clásico, la jerarquíade sistemas deductivos SMM–n con n > 1. SMM–n es el sistema multi–modalde profundidad–n. El sistema SMM–1 es el cálculo proposicional clásico.
Manuel Sierra A.
doaj