Disciplines
Computer Sciences (5%); Mathematics (95%)
Keywords
-
Gödel logics,
One- And To-Variable Fragment,
Intermediate Logics,
Monadic Fragment
Gödel logics are one of the most important examples of manyvalued logics. They are both intermediate logics (logics between classical and intuitionistic logic) and prominent examples for fuzzy logics. The concept of fuzzy properties has been propagated by Lotfi Zadeh to represent inferences involving vague information, it is now the basis of various applications. Although this project addresses mathematical problems it is intended to incorporate the results into the most important expert system for medical diagnosis at the Vienna General Hospital. Fuzzy logics in general allow sentences to be assigned not only 1 for true and 0 for false, but also any number between 0 and 1 to represent relative falsity or truth. In Gödel logics, the meaning of these truth values only depends on their order. Kurt Gödel (19061978), one of the most famous logicians of modern age, described this group of logics to prove that infinitely many logics between intuitionistic and classic logic exist. This project deals in particular with the characterization of the monadic fragments of Gödel logics. These fragments are formed by restricting the predicate symbols to unary ones and constitute the most important fragment in the language of predicate logic. We aim to determine the decidability of the validity and of the satisfiability of sentences in this fragment and in the related onevariable and twovariable fragments. We also want to investigate the closely linked problem whether the validity of sentences in the monadic fragment of ukasiewicz logic is decidable. This is the most important among the open mathematical problems in the field of fuzzy logic.
The monadic fragment is one of the most important fragments of first-order logics. It formalizes e.g. the syllogisms of Aristoteles and most of rule-based systems. This fragment is decidable in classical logic. There is a lot of research going on with respect to this fragment due to its importance to publications.In this project we investigated the monadic fragments of Gödel logics.Gödel logics form an important class of intermediate logics. They are connected to Fuzzy reasoning. They are defined by closed subsets of [0; 1], which include 0 and 1.The project distinguished the problem of validity from the problem of 1-satisfiability. Validity is not dual to 1-satisfiability when addressing non classical logics. The project obtains a full classification of the decidability status of monadic first-order logics:1. The monadic fragment of all finitely-valued first-order Gödel logics is decidable with respect to validity and 1-satisfiability.2. The monadic fragment of all infinitely-valued Gödel logics is undecidable with respect to validity.3. The monadic fragment of infinitely-valued Gödel logics is decidable with respect to 1-satisfiability if and only if 0 is isolated in the set of truth values.
- Technische Universität Wien - 100%
- Petr Cintula, Academy of Sciences of the Czech Republic - Czechia
- Petr Hajek, Czech Academy of Science - Czechia
- Arnon Avron, Tel Aviv University - Israel
- Franco Montagna, Universita degli Studi di Siena - Italy
- Hiroakira Ono, Japan Advanced Institute of Science and Technology - Japan
- Rosalie Iemhoff, Universiteit Utrecht - Netherlands
- Valentin Shehtman, Moscow State University - Russia
- George Metcalfe, University of Bern - Switzerland
Research Output
- 96 Citations
- 19 Publications
-
2022
Title Exploring breast cancer exosomes for novel biomarkers of potential diagnostic and prognostic importance DOI 10.1007/s13205-022-03422-w Type Journal Article Author Alagundagi D Journal 3 Biotech Pages 7 Link Publication -
2012
Title Effective Finite-Valued Semantics for Labelled Calculi DOI 10.1007/978-3-642-31365-3_7 Type Book Chapter Author Baaz M Publisher Springer Nature Pages 52-66 -
2013
Title Automated Support for the Investigation of Paraconsistent and Other Logics DOI 10.1007/978-3-642-35722-0_9 Type Book Chapter Author Ciabattoni A Publisher Springer Nature Pages 119-133 -
2012
Title Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability DOI 10.2168/lmcs-8(1:20)2012 Type Journal Article Author Baaz M Journal Logical Methods in Computer Science Link Publication -
2012
Title Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability DOI 10.48550/arxiv.1202.6352 Type Preprint Author Baaz M -
2012
Title Gödel logics with monotone operators DOI 10.1016/j.fss.2011.04.012 Type Journal Article Author Baaz M Journal Fuzzy Sets and Systems Pages 3-13 Link Publication -
2012
Title Canonical signed calculi with multi-ary quantifiers DOI 10.1016/j.apal.2011.09.006 Type Journal Article Author Zamansky A Journal Annals of Pure and Applied Logic Pages 951-960 Link Publication -
2012
Title On the complexity of proof deskolemization DOI 10.2178/jsl/1333566645 Type Journal Article Author Baaz M Journal The Journal of Symbolic Logic Pages 669-686 -
2011
Title Gödel-Dummet logics. Type Book Chapter Author Baaz M -
2013
Title Finite-valued Semantics for Canonical Labelled Calculi DOI 10.1007/s10817-013-9273-x Type Journal Article Author Baaz M Journal Journal of Automated Reasoning Pages 401-430 -
2013
Title Gödel Homomorphisms as Gödel Modal Operators DOI 10.3233/fi-2013-799 Type Journal Article Author Fasching O Journal Fundamenta Informaticae Pages 43-57 -
2013
Title Gödel Homomorphisms as Gödel modal operators. Type Journal Article Author Fasching O -
2009
Title Note on witnessed Gödel logics with Delta DOI 10.1016/j.apal.2009.05.011 Type Journal Article Author Baaz M Journal Annals of Pure and Applied Logic Pages 121-127 Link Publication -
2009
Title SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability DOI 10.1007/978-3-642-02261-6_10 Type Book Chapter Author Baaz M Publisher Springer Nature Pages 113-123 -
2009
Title Eskolemization in Intuitionistic Logic DOI 10.1093/logcom/exp040 Type Journal Article Author Baaz M Journal Journal of Logic and Computation Pages 625-638 Link Publication -
2010
Title Gödel logics with an operator shifting truth values. Type Conference Proceeding Abstract Author Baaz M Conference LPAR; short papers (Yogyakarta) -
2011
Title Methods of Cut-Elimination. Type Book Chapter Author Baaz M -
2011
Title First-order satisfiability in Gödel logics: An NP-complete fragment DOI 10.1016/j.tcs.2011.07.015 Type Journal Article Author Baaz M Journal Theoretical Computer Science Pages 6612-6623 Link Publication -
2011
Title A framework for reasoning under uncertainty based on non-deterministic distance semantics DOI 10.1016/j.ijar.2010.07.006 Type Journal Article Author Arieli O Journal International Journal of Approximate Reasoning Pages 184-211