Results 11 to 20 of about 74,540 (198)
Algebraic semantics for one-variable lattice-valued logics
, 2022 The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic semantics for these logics have been obtained: most notably, for the modal counterparts S5 and MIPC of the one ...
Petr Cintula +2 more
openalex +4 more sources
Mendler-style Iso-(Co)inductive predicates: a strongly normalizing approach [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles.
Favio Ezequiel Miranda-Perea +1 more
doaj +4 more sources
The lattice of all 4-valued implicative expansions of Belnap–Dunn logic containing Routley and Meyer’s basic logic Bd [PDF]
, 2023 [EN] The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with ∧, v and ~ as the sole primitive connectives.
Gemma Robles, José M. Méndez
openalex +3 more sources
Determination of 3-Ary -Resolution in Lattice-valued Propositional Logic LP(X) [PDF]
International Journal of Computational Intelligence Systems, 2013 One of key issues for -() ary resolution automated reasoning based on lattice-valued logic with truth-value in a lattice implication algebra is to investigate the -() ary resolution of some generalized literals.
Yi Liu, Hairui Jia, Yang Xu
doaj +2 more sources
Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence [PDF]
, 2016 In the present paper, various features of the class of propositional literal paralogics are considered. Literal paralogics are logics in which the paraproperties such as paraconsistence, paracompleteness and paranormality, occur only at the level of ...
Alexander S. Karpenko, Natalya Tomova
openalex +4 more sources
Researches on Six Lattice-Valued Logic
Journal of Computer and Communications, 2015 Based on the direct product of Boolean algebra and Lukasiewicz algebra, six lattice-valued logic is put forward in this paper. The algebraic structure and properties of the lattice are analyzed profoundly and the tautologies of six-valued logic system L6P(X) are discussed deeply.
Hua Li
openalex +4 more sources
Categorical study for Algebras of lattice-valued logic and lattice-valued modal logic
, 2018 The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of functors. As a result, we get a duality for algebras of lattice-valued logic.
Kumar S. Ray, Litan Kumar Das
openalex +4 more sources
State hyperstructures of tree automata based on lattice-valued logic [PDF]
RAIRO - Theoretical Informatics and Applications, 2018 In this paper, an association is organized between the theory of tree automata on one hand and the hyperstructures on the other hand, over complete residuated lattices. To this end, the concept of order of the states of a complete residuated lattice-valued tree automaton (simply L-valued tree automaton) is introduced along with several equivalence ...
Maryam Ghorani
openalex +3 more sources
α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X) [PDF]
International Journal of Computational Intelligence Systems, 2014 This paper is focused on α-generalized semantic resolution automated reasoning method in linguistic truth-valued lattice-valued propositional logic.
Jiafeng Zhang, Yang Xu, Xingxing He
doaj +1 more source
α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic [PDF]
International Journal of Computational Intelligence Systems, 2012 This paper focuses on effcient non-clausal resolution-based automated reasoning methods and algorithms for a lattice-ordered linguistic truth-valued logic, which corresponds to extensions of α-lock resolution.
Xingxing He +3 more
doaj +1 more source