I argue that dialetheists have a problem with the concept of logical consequence. The upshot of this problem is that dialetheists must appeal to a hierarchy of concepts of logical consequence. Since this hierarchy is akin to those invoked by more orthodox resolutions of the semantic paradoxes, its emergence would appear to seriously undermine the dialetheic treatments of these paradoxes. And since these are central to the case for dialetheism, this would represent a significant blow to the position itself.

I argue that dialetheists have a problem with the concept of logical consequence. The upshot of this problem is that dialetheists must appeal to a hierarchy of concepts of logical consequence. Since this hierarchy is akin to those invoked by more orthodox resolutions of the semantic paradoxes, its emergence would appear to seriously undermine the dialetheic treatments of these paradoxes. And since these are central to the case for dialetheism, this would represent a significant blow to the position itself.

We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: -CA0 (...) (second-order number theory with a -comprehension axiom scheme) is insufficient. We briefly consider his claim to have produced a solution to the semantic paradoxes by introducing this conditional. We remark that the notion of a operator can be introduced in other settings. (shrink)

There is little doubt that a second-order axiomatization of Zermelo-Fraenkel set theory plus the axiom of choice (ZFC) is desirable. One advantage of such an axiomatization is that it permits us to express the principles underlying the first-order schemata of separation and replacement. Another is its almost-categoricity: M is a model of second-order ZFC if and only if it is isomorphic to a model of the form Vκ, ∈ ∩ (Vκ × Vκ) , for κ a strongly inaccessible ordinal.

Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...) measurable cardinals, whether or not those facts are knowable by us. (shrink)

This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. It aims to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named ‘fuzzy inference’ can be naturally understood as logical deduction. It is for mathematicians, logicians, computer scientists, specialists in artificial intelligence and knowledge engineering, and developers of fuzzy logic.

In 1957, Gödel proved that completeness for intuitionistic predicate logic HPL implies forms of Markov's Principle, MP. The result first appeared, with Kreisel's refinements and elaborations, in Kreisel. Featuring large in the Gödel-Kreisel proofs are applications of the axiom of dependent choice, DC. Also in play is a form of Herbrand's Theorem, one allowing a reduction of HPL derivations for negated prenex formulae to derivations of negations of conjunctions of suitable instances. First, we here show how to deduce Gödel's results (...) by alternative means, ones arguably more elementary than those of Kreisel. We avoid DC and Herbrand's Theorem by marshalling simple facts about negative translations and Markov's Rule. Second, the theorems of Gödel and Kreisel are commonly interpreted as demonstrating the unprovability of completeness for HPL, if means of proof are confined within strictly intuitionistic metamathematics. In the closing section, we assay some doubts about such interpretations. (shrink)

In this paper, we distinguish two versions of Curry's paradox: c-Curry, the standard conditional-Curry paradox, and v-Curry, a validity-involving version of Curry's paradox that isn’t automatically solved by solving c-curry. A unified treatment of curry paradox thus calls for a unified treatment of both c-Curry and v-Curry. If, as is often thought, c-Curry paradox is to be solved via non-classical logic, then v-Curry may require a lesson about the structure—indeed, the substructure—of the validity relation itself.

A selective background -- Broadly classical approaches -- Paracompleteness -- More on paracomplete solutions -- Paraconsistent dialetheism.

Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...) measurable cardinals, whether or not those facts are knowable by us. (shrink)

Here is an account of logical consequence inspired by Bolzano and Tarski. Logical validity is a property of arguments. An argument is a pair of a set of interpreted sentences (the premises) and an interpreted sentence (the conclusion). Whether an argument is logically valid depends only on its logical form. The logical form of an argument is fixed by the syntax of its constituent sentences, the meanings of their logical constituents and the syntactic differences between their non-logical constituents, treated as (...) variables. A constituent of a sentence is logical just if it is formal in meaning, in the sense roughly that its application is invariant under permutations of individuals.1 Thus ‘=’ is a logical constant because no permutation maps two individuals to one or one to two; ‘∈’ is not a logical constant because some permutations interchange the null set and its singleton. Truth functions, the usual quantifiers and bound variables also count as logical constants. An argument is logically valid if and only if the conclusion is true under every assignment of semantic values to variables (including all non-logical expressions) under which all its premises are true. A sentence is logically true if and only if the argument with no premises of which it is the conclusion is logically valid, that is, if and only if the sentence is true under every assignment of semantic values to variables. An interpretation assigns values to all variables. (shrink)

It is “the received wisdom” that any intuitively natural and consistent resolution of a class of semantic paradoxes immediately leads to other paradoxes just as bad as the first. This is often called the “revenge problem”. Some proponents of the received wisdom draw the conclusion that there is no hope of any natural treatment that puts all the paradoxes to rest: we must either live with the existence of paradoxes that we are unable to treat, or adopt artificial and ad (...) hoc means to avoid them. Others (“dialetheists”) argue that we can put the paradoxes to rest, but only by licensing the acceptance of some contradictions (presumably in a paraconsistent logic that prevents the contradictions from spreading everywhere). (shrink)