68 found
Order:
  1.  40
    On Theories and Models in Fuzzy Predicate Logics.Petr Hájek & Petr Cintula - 2006 - Journal of Symbolic Logic 71 (3):863 - 880.
    In the last few decades many formal systems of fuzzy logics have been developed. Since the main differences between fuzzy and classical logics lie at the propositional level, the fuzzy predicate logics have developed more slowly (compared to the propositional ones). In this text we aim to promote interest in fuzzy predicate logics by contributing to the model theory of fuzzy predicate logics. First, we generalize the completeness theorem, then we use it to get results on conservative extensions of theories (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  2.  26
    Residuated Fuzzy Logics with an Involutive Negation.Francesc Esteva, Lluís Godo, Petr Hájek & Mirko Navara - 2000 - Archive for Mathematical Logic 39 (2):103-124.
    Residuated fuzzy logic calculi are related to continuous t-norms, which are used as truth functions for conjunction, and their residua as truth functions for implication. In these logics, a negation is also definable from the implication and the truth constant $\overline{0}$ , namely $\neg \varphi$ is $\varphi \to \overline{0}$. However, this negation behaves quite differently depending on the t-norm. For a nilpotent t-norm (a t-norm which is isomorphic to Łukasiewicz t-norm), it turns out that $\neg$ is an involutive negation. However, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  3.  26
    A Complete Many-Valued Logic with Product-Conjunction.Petr Hájek, Lluis Godo & Francesc Esteva - 1996 - Archive for Mathematical Logic 35 (3):191-208.
    A simple complete axiomatic system is presented for the many-valued propositional logic based on the conjunction interpreted as product, the coresponding implication (Goguen's implication) and the corresponding negation (Gödel's negation). Algebraic proof methods are used. The meaning for fuzzy logic (in the narrow sense) is shortly discussed.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  4.  92
    The Liar Paradox and Fuzzy Logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
    Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}(\bar{\varphi})$ for all sentences φ? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  5.  54
    On Łukasiewicz's Four-Valued Modal Logic.Josep Maria Font & Petr Hájek - 2002 - Studia Logica 70 (2):157-182.
    ukasiewicz''s four-valued modal logic is surveyed and analyzed, together with ukasiewicz''s motivations to develop it. A faithful interpretation of it in classical (non-modal) two-valued logic is presented, and some consequences are drawn concerning its classification and its algebraic behaviour. Some counter-intuitive aspects of this logic are discussed in the light of the presented results, ukasiewicz''s own texts, and related literature.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  6.  63
    A New Small Emendation of Gödel's Ontological Proof.Petr Hájek - 2002 - Studia Logica 71 (2):149 - 164.
  7.  23
    On Arithmetic in the Cantor- Łukasiewicz Fuzzy Set Theory.Petr Hájek - 2005 - Archive for Mathematical Logic 44 (6):763-782.
    Axiomatic set theory with full comprehension is known to be consistent in Łukasiewicz fuzzy predicate logic. But we cannot assume the existence of natural numbers satisfying a simple schema of induction; this extension is shown to be inconsistent.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  8.  60
    Rational Pavelka Predicate Logic is a Conservative Extension of Łukasiewicz Predicate Logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (2):669-682.
    Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants r̄ for rationals in [0, 1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  9. On Vagueness, Truth Values and Fuzzy Logics.Petr Hájek - 2009 - Studia Logica 91 (3):367-382.
    Some aspects of vagueness as presented in Shapiro’s book Vagueness in Context [23] are analyzed from the point of fuzzy logic. Presented are some generalizations of Shapiro’s formal apparatus.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  10. Experimental Logics and Π3 0 Theories.Petr Hájek - 1977 - Journal of Symbolic Logic 42 (4):515-522.
  11.  44
    Fuzzy Logic and Arithmetical Hierarchy III.Petr Hájek - 2001 - Studia Logica 68 (1):129-142.
    Fuzzy logic is understood as a logic with a comparative and truth-functional notion of truth. Arithmetical complexity of sets of tautologies and satisfiable sentences as well of sets of provable formulas of the most important systems of fuzzy predicate logic is determined or at least estimated.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  12.  69
    Knowledge-Driven Versus Data-Driven Logics.Didier Dubois, Petr Hájek & Henri Prade - 2000 - Journal of Logic, Language and Information 9 (1):65--89.
    The starting point of this work is the gap between two distinct traditions in information engineering: knowledge representation and data - driven modelling. The first tradition emphasizes logic as a tool for representing beliefs held by an agent. The second tradition claims that the main source of knowledge is made of observed data, and generally does not use logic as a modelling tool. However, the emergence of fuzzy logic has blurred the boundaries between these two traditions by putting forward fuzzy (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  13.  10
    Formal Systems of Fuzzy Logic and Their Fragments.Petr Cintula, Petr Hájek & Rostislav Horčík - 2007 - Annals of Pure and Applied Logic 150 (1-3):40-65.
    Formal systems of fuzzy logic are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  14.  15
    The Logic of Π1-Conservativity.Petr Hajek & Franco Montagna - 1990 - Archive for Mathematical Logic 30 (2):113-123.
    We show that the modal prepositional logicILM (interpretability logic with Montagna's principle), which has been shown sound and complete as the interpretability logic of Peano arithmetic PA (by Berarducci and Savrukov), is sound and complete as the logic ofπ 1-conservativity over eachbE 1-sound axiomatized theory containingI⌆ 1 (PA with induction restricted tobE 1-formulas). Furthermore, we extend this result to a systemILMR obtained fromILM by adding witness comparisons in the style of Guaspari's and Solovay's logicR (this will be done in a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  15.  18
    Fuzzy Logic.Petr Hajek - 2008 - Stanford Encyclopedia of Philosophy.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  16.  11
    On Witnessed Models in Fuzzy Logic.Petr Hájek - 2007 - Mathematical Logic Quarterly 53 (1):66-77.
    Witnessed models of fuzzy predicate logic are models in which each quantified formula is witnessed, i.e. the truth value of a universally quantified formula is the minimum of the values of its instances and similarly for existential quantification. Systematic theory of known fuzzy logics endowed with this semantics is developed with special attention paid to problems of arithmetical complexity of sets of tautologies and of satisfiable formulas.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  17.  10
    The Liar Paradox and Fuzzy Logic.Petr Hajek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
    Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}$ for all sentences $\varphi$? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  18.  38
    Fuzzy Logic and Arithmetical Hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.
    A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  19.  10
    Complexity of T-Tautologies.Matthias Baaz, Petr Hájek, Franco Montagna & Helmut Veith - 2001 - Annals of Pure and Applied Logic 113 (1-3):3-11.
    A t-tautology is a propositional formula which is a tautology in all fuzzy logics defined by continuous triangular norms. In this paper we show that the problem of recognizing t-tautologies is coNP complete, and thus decidable.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  20.  23
    On Witnessed Models in Fuzzy Logic II.Petr Hájek - 2007 - Mathematical Logic Quarterly 53 (6):610-615.
    First the expansion of the Łukasiewicz logic by the unary connectives of dividing by any natural number is studied; it is shown that in the predicate case the expansion is conservative w.r.t. witnessed standard 1-tautologies. This result is used to prove that the set of witnessed standard 1-tautologies of the predicate product logic is Π2-hard.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  21.  16
    Patrick Grim, Gary Mar, and Paul St. Denis. The Philosophical Computer. Exploratory Essays in Philosophical Computer Modeling. With the Group for Logic and Formal Semantics. The MIT Press, Cambridge, Mass., and London, 1998, Viii + 323 Pp. + CD-ROM. [REVIEW]Petr Hájek - 2000 - Bulletin of Symbolic Logic 6 (3):347-349.
  22.  17
    Gödel '96 Logical Foundations of Mathematics, Computer Science and Physics Kurt GÖdel's Legacy.Petr Hájek & Jiří Zlatuška - 1996 - Bulletin of Symbolic Logic 2 (4):473-473.
  23.  23
    Über Die Gültigkeit Des Fundierungsaxioms in Speziellen Systemen Der Mengentheorie.Petr Vopênka & Petr Hájek - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (12-15):235-241.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   4 citations  
  24.  12
    Ten Questions and One Problem on Fuzzy Logic.Petr Hájek - 1999 - Annals of Pure and Applied Logic 96 (1-3):157-165.
  25.  17
    On Sequences of Degrees of Constructibility.Bohuslav Balcar & Petr Hájek - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (19-24):291-296.
  26.  26
    A Note on the Normal Form of Closed Formulas of Interpretability Logic.Petr Hájek & Vítězslav Švejdar - 1991 - Studia Logica 50 (1):25 - 28.
    Each closed (i.e. variable free) formula of interpretability logic is equivalent in ILF to a closed formula of the provability logic G, thus to a Boolean combination of formulas of the form n.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  12
    A Note on the First‐Order Logic of Complete BL‐Chains.Petr Hájek & Franco Montagna - 2008 - Mathematical Logic Quarterly 54 (4):435-446.
    In [10] it is claimed that the set of predicate tautologies of all complete BL-chains and the set of all standard tautologies coincide. As noticed in [11], this claim is wrong. In this paper we show that a complete BL-chain B satisfies all standard BL-tautologies iff for any transfinite sequence of elements of B, the condition ∧i ∈ I = 2 holds in B.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  28.  10
    Über Die Gültigkeit Des Fundierungsaxioms in Speziellen Systemen Der Mengentheorie.Petr Vopênka & Petr Hájek - 1963 - Mathematical Logic Quarterly 9 (12‐15):235-241.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   4 citations  
  29.  10
    The Logic ofII 1-Conservativity Continued.Petr Hájek & Franco Montagna - 1992 - Archive for Mathematical Logic 32 (1):57-63.
    It is shown that the propositional modal logic IRM (interpretability logic with Montagna's principle and with witness comparisons in the style of Guaspari's and Solovay's logicR) is sound and complete as the logic ofII 1-conservativity over each∑ 1-sound axiomatized theory containingI∑ 1. The exact statement of the result uses the notion of standard proof predicate. This paper is an immediate continuation of our paper [HM]. Knowledge of [HM] is presupposed. We define a modal logic, called IRM, which includes both ILM (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  30.  49
    Embedding Logics Into Product Logic.Matthias Baaz, Petr Hájek, David Švejda & Jan Krajíček - 1998 - Studia Logica 61 (1):35-47.
    We construct a faithful interpretation of ukasiewicz's logic in product logic (both propositional and predicate). Using known facts it follows that the product predicate logic is not recursively axiomatizable.We prove a completeness theorem for product logic extended by a unary connective of Baaz [1]. We show that Gödel's logic is a sublogic of this extended product logic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  6
    Logic, Methodology, and Philosophy of Science.Petr Hájek, Luis Valdés-Villanueva & Dag Westerståhl (eds.) - 2005 - College Publications.
    This book collects most of the invited papers presented at the 12th International Congress of Logic, Methodology and Philosophy of Science in Oviedo, August 2003. It contains state of the art accounts of ongoing work by a selection of the most renowned researchers in the field. The papers in the Logic section deal with topics in mathematical logic, as well as philosophical logic, and the area of logic and computation. The section on General Methodology contains articles on models, theories, probability, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  13
    Arithmetical Complexity of Fuzzy Predicate Logics—a Survey II.Petr Hájek - 2010 - Annals of Pure and Applied Logic 161 (2):212-219.
    Results on arithmetical complexity of important sets of formulas of several fuzzy predicate logics are surveyed and some new results are proven.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  5
    On Sequences of Degrees of Constructibility (Solution of Friedman'S Problem 75).Bohuslav Balcar & Petr Hájek - 1978 - Mathematical Logic Quarterly 24 (19‐24):291-296.
  34.  27
    Monadic Fuzzy Predicate Logics.Petr Hájek - 2002 - Studia Logica 71 (2):165-175.
    Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to finite model property (properties) and arithmetical complexity of sets of tautologies, satisfiable formulas and of analogous notion restricted to finite models.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  11
    On Witnessed Models in Fuzzy Logic III - Witnessed Gödel Logics.Petr Häjek - 2010 - Mathematical Logic Quarterly 56 (2):171-174.
    Gödel logics with truth sets being countable closed subsets of the unit real interval containing 0 and 1 are studied under their usual semantics and under the witnessed semantics, the latter admitting only models in which the truth value of each universally quantified formula is the minimum of truth values of its instances and dually for existential quantification and maximum. An infinite system of such truth sets is constructed such that under the usual semantics the corresponding logics have pairwise different (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  36. Ontological Proofs of Existence and Non-Existence.Petr Hájek - 2008 - Studia Logica 90 (2):257-262.
    Caramuels’ proof of non-existence of God is compared with Gödel’s proof of existence.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  25
    A Note on the Notion of Truth in Fuzzy Logic.Petr Hájek & John Shepherdson - 2001 - Annals of Pure and Applied Logic 109 (1-2):65-69.
    In fuzzy predicate logic, assignment of truth values may be partial, i.e. the truth value of a formula in an interpretation may be undefined . A logic is supersound if each provable formula is true in each interpretation in which the truth value of is defined. It is shown that among the logics given by continuous t-norms, Gödel logic is the only one that is supersound; all others are not supersound. This supports the view that the usual restriction of semantics (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. Special Issue: Methods for Investigating Self-Referential Truth Edited by Volker Halbach Volker Halbach/Editorial Introduction 3.Petr Hájek, Arithmetical Hierarchy Iii, Gerard Allwein & Wendy MacCaull - 2001 - Studia Logica 68:421-422.
  39.  22
    How Much Propositional Logic Suffices for Rosser’s Essential Undecidability Theorem?Guillermo Badia, Petr Cintula, Petr Hajek & Andrew Tedder - forthcoming - Review of Symbolic Logic:1-18.
    In this paper we explore the following question: how weak can a logic be for Rosser's essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson's Q is essentially undecidable in intuitionistic logic, and P. Hajek proved it in the fuzzy logic BL for Grzegorczyk's variant of Q which interprets the arithmetic operations as non-total non-functional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  40.  23
    On Recursion Theory in I∑.Petr Hájek & Antonín Kučera - 1989 - Journal of Symbolic Logic 54 (2):576 - 589.
    It is shown that the low basis theorem is meaningful and provable in I∑ 1 and that the priority-free solution to Post's problem formalizes in this theory.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41.  22
    Erwin Engeler and Peter Läuchli. Berechnungstheorie für Informatiker. With assistance from Ronald Peikert. Leitfäden und Monographien der Informatik. B. G. Teubner, Stuttgart1988, 120 pp. - Arnold Oberschelp. Rekursionstheorie. B. I. Wissenschaftsverlag, Mannheim, Leipzig, Vienna, and Zürich, 1993, 339 pp. - Walter Felscher. Berechenbarkeit. Rekursive und programmierbare Funktionen. Springer-Lehrbuch. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1993, xi + 478 pp. [REVIEW]Petr Hájek - 1996 - Journal of Symbolic Logic 61 (2):699-701.
    Direct download (6 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  42.  9
    On Recursion Theory in $Isum_1$.Petr Hajek & Antonin Kucera - 1989 - Journal of Symbolic Logic 54 (2):576-589.
    It is shown that the low basis theorem is meaningful and provable in $I\sum_1$ and that the priority-free solution to Post's problem formalizes in this theory.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43. How Much Propositional Logic Suffices for Rosser's Essential Undecidability Theorem?Guillermo Badia, Petr Cintula, Petr Hajek & Andrew Tedder - forthcoming - Review of Symbolic Logic.
    In this paper we explore the following question: how weak can a logic be for Rosser’s essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson’s Q is essentially undecidable in intuitionistic logic, and P. Hájek proved it in the fuzzy logic BL for Grzegorczyk’s variant of Q which interprets the arithmetic operations as nontotal nonfunctional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much (...)
     
    Export citation  
     
    Bookmark  
  44. Logical Models of Reasoning with Vague Information.Petr Cintula, Chris Fermüller, Lluis Godo & Petr Hájek (eds.) - forthcoming
    Translate
     
     
    Export citation  
     
    Bookmark  
  45. Reasoning Under Vagueness.Petr Cintula, Christian Fermuller, Lluis Godo & Petr Hajek (eds.) - forthcoming - College Publications.
    Translate
     
     
    Export citation  
     
    Bookmark  
  46.  1
    Understanding Vagueness: Logical, Philosophical, and Linguistic Perspectives.Petr Cintula, Christian G. Fermüller, Lluis Godo & Petr Hájek (eds.) - 2011 - College Publications.
    Vague language and corresponding models of inference and information processing is an important and challenging topic as witnessed by a number of recent monographs and collections of essays devoted to the topic. This volume collects fifteen papers, the majority of which originated with talks presented at the conference "Logical Models of Reasoning with Vague Information ", September 14-17, 2009, in Čejkovice, that initiated a EUROCORES/LogICCC project with the same title. At least two features set the current volume apart from other (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  47. Brno, Czech Republic, August 25–29, 1996.G. F. R. Ellis, Solomon Feferman, Daniel Isaacson, Boris A. Kushner, Petr Hájek & Jirı Zlatuška - 1996 - Bulletin of Symbolic Logic 2 (4).
  48. REVIEWS-The Philosophical Computer.P. Grim, G. Mar, P. St Denis & Petr Hajek - 2000 - Bulletin of Symbolic Logic 6 (3):347-348.
  49. Die durch die schwach inneren relationen gegebenen modelle der mengenlehre.Petr Hájek - 1964 - Mathematical Logic Quarterly 10 (9‐12):151-157.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  50. Epistemic Entrenchment and Arithmetical Hierarchy.Petr Hájek - 1994 - Artificial Intelligence 65 (1):191.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 68