Results 11 to 20 of about 231 (54)
Ingeniería y Ciencia, 2012 Se presenta como extensión del cálculo proposicional clásico, el sistema deductivo LT: lógica de las tautologías. En el sistema LT, se formalizan las nociones meta-lógicas de tautología, contradicción, satisfacible, refutable y contingencia.
Manuel Sierra A.
doaj +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
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
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
Dual characterizations for finite lattices via correspondence theory for monotone modal logic [PDF]
, 2016 International audienceWe establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation's characterization of a hierarchy of pseudovarieties of finite lattices ...
Frittella, Sabine +2 more
core +2 more sources
Canonical varieties with no canonical axiomatisation
, 2005 Accepted ...
Hodkinson, I, Venema, Y
core +5 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
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
Lógica básica con afirmación alterna
Ingeniería y Ciencia, 2005 El lenguaje del sistema extiende el lenguaje de la lógica clásica al incluir un operador para la noción de afirmación alterna (en contraste con la afirmación clásica o afirmación usual), y también operadores de incompatibilidad y determinabilidad entre ...
Manuel Sierra A.
doaj