Abstract | ||
---|---|---|
In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an -rule. |
Year | DOI | Venue |
---|---|---|
2018 | https://doi.org/10.1007/s11225-017-9751-y | Studia Logica |
Keywords | Field | DocType |
Truth,Partial logic,Infinitary proof systems,Axiomatic theories,Minimal fixed-point | Discrete mathematics,Proof by contradiction,Algorithm,Truth predicate,Predicate logic,Mathematics,Semantics,Direct proof | Journal |
Volume | Issue | ISSN |
106 | 3 | 0039-3215 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Martin Fischer | 1 | 13 | 1.77 |
Norbert Gratzl | 2 | 10 | 3.89 |