Results 11 to 20 of about 261 (63)
The modal logic of Reverse Mathematics [PDF]
, 2014 The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way.
Mummert, Carl +2 more
core +1 more source
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
Coupled Anti Fuzzy Subrings Using t-Conorms
, 2021 The aim of this paper is to introduce the concept of coupled anti fuzzy subrings by using t-conorm C. By using t-conorm C; we consider the relationship between coupled subrings and coupled anti fuzzy subrings and we prove that the intersection of two ...
C. Ampadu
semanticscholar +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
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
SUT Journal of Mathematics, 1997 We investigate a poly-modal logic S5nC which has n-modalities (n > 1) satisfying the axioms of S5 and has axioms expressing permutability of modalities.
P. A. Alexeev, M. Golovanov
semanticscholar +1 more source
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