Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 44 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

On some many-valued abstract logics and their Epsilon-T-style extensions (1209.5364v1)

Published 24 Sep 2012 in cs.LO and math.LO

Abstract: Logical systems with classical negation and means for sentential or propositional self-reference involve, in some way, paradoxical statements such as the liar. However, the paradox disappears if one replaces classical by an appropriate non-classical negation such as a paraconsistent one (no paradox arises if the liar is both true and false). We consider a non-Fregean logic which is a revised and extended version (Lewitzka 2012) of Epsilon-T-Logic originally introduced by (Straeter 1992) as a logic with a total truth predicate and propositional quantifiers. Self-reference is achieved by means of equations between formulas which are interpreted over a model-theoretic universe of propositions. Paradoxical statements, such as the liar, can be asserted only by unsatisfiable equations and do not correlate with propositions. In this paper, we generalize Epsilon-T-Logic to a four-valued logic related to Dunn/Belnap logic B_4. We also define three-valued versions related to Kleene's logic K_3 and Priest's Logic of Paradox P_3, respectively. In this many-valued setting, models may contain liars and other "paradoxical" propositions which are ruled out by the more restrictive classical semantics. We introduce these many-valued non-Fregean logics as extensions of abstract parameter logics such that parameter logic and extension are of the same logical type. For this purpose, we define and study abstract logics of type B_4, K_3 and P_3. Using semantic methods we show compactness of the consequence relation of abstract logics of type B_4, give a representation as minimally generated logics and establish a connection to the approach of (Font 1997). Finally, we present a complete sequent calculus for the Epsilon-T-style extension of classical abstract logics simplifying constructions originally developed by (Straeter 1992, Zeitz 2000, Lewitzka 1998).

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)