Filters
An Algebraic View of Super-Belnap Logics
filters, and strong versions of super-Belnap logics, as well as the classificationThe Belnap–Dunn logic (also known as First Degree Entailment, or FDE) is a well-known and well-studied four-valued logic, ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Substructural inquisitive logics
This paper shows that any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) c...
Philosophy, History and Philosophy of science and technology
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Decidability for S4 Gödel Modal Logics
We introduce semantics for crisp and fuzzy Gödel S4 based on bi-relational frames. We then show that each version of the logic is sound and complete for its respective class of frames and enjoys the finite model property. From this ...
Pure mathematics
- 2023 •
- C •
- Link
Rok uplatnění
C - Kapitola v odborné knize
Výsledek na webu
Expressivity of Some Versions of APAL
Arbitrary public announcement logic (APAL) is a logic of change of knowledge different versions of APAL wherein this quantification is restricted to formulas only version quantifying over all announcements implied ...
Pure mathematics
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
SPASS Version 3.5
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. We describe our recent developments in SPASS 3.5......
BA - Obecná matematika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
On the Failure of Standard Completeness in PiMTL for Infinite Theories
characteristic of product logic) does not enjoy the strong standard completeness theorem likeIt is well-known that Hájek's Basic Fuzzy Logic (BL), Lukasiewicz logic, and product logic are not strongly sta...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Chain logic and Shelah’s infinitary logic
, Karp’s chain logic [20] is above Lκ1. Moreover, we show that if κ is a strong limit is a maximal logic with chain models to satisfy a version of the undefinability of wellFor a cardinal of the form κ = בκ, Shelah...
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Substructural propositional dynamic logics
We prove completeness and decidability of a version of Propositional Dynamic Logic where the underlying non-modal propositional logic is a substructural logic in the vicinity of the Full Distributive Non-associativ...
Pure mathematics
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Observations on Non-commutative Fuzzy Logic.
The paper presents some results on the logic psBL (pseudo-basic fuzzy logic, the generalization of BL not assuming commutativity of conjunction) and on the analogous logic psMTL - a non-commutative version of the m...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The LPi and LPi/2 Propositional and Predicate Logics.
In fuzzy logic three main logics are investigated (Godel,product and Lukasiewicz logic). There are logics LPi and LPi1/2 uniting these three logics. We show an alternative axiomatic system of these log...
BA - Obecná matematika
- 2001 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 41 933