Notes on the mathematical aspects of Kripke's theory of truth
From MaRDI portal
Publication:1073007
DOI10.1305/NDJFL/1093636525zbMATH Open0588.03003OpenAlexW2056546032MaRDI QIDQ1073007FDOQ1073007
Authors: Melvin Fitting 
Publication date: 1986
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093636525
Recommendations
Cited In (20)
- Programming in three-valued logic
- Axiomatizing Kripke's theory of truth
- Construction of Truth Predicates: Approximation Versus Revision
- The anatytic conception of truth and the foundations of arithmetic
- Revision without revision sequences: self-referential truth
- A theory of truth that prefers falsehood
- From closure games to strong Kleene truth
- Revision without revision sequences: circular definitions
- Guest editors' introduction
- On \(\mathcal{F} \)-systems: a graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks
- Truth, dependence and supervaluation: living with the ghost
- Notes on models of (partial) Kripke-Feferman truth
- ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS
- Title not available (Why is that?)
- A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
- Alternative ways for truth to behave when there's no vicious reference
- Protected completions of first-order general logic programs
- On the weak Kleene scheme in Kripke's theory of truth
- Bilattices and the theory of truth
- Notes on the computational aspects of Kripke's theory of truth
This page was built for publication: Notes on the mathematical aspects of Kripke's theory of truth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073007)
