ABSTRACT In ‘Properties, Propositions, and Conditionals’ Field [2021] advances further on our understanding of the logic and meaning of naive theories – theories that maintain, in the face of paradox, basic assumptions about properties and propositions. His work follows in a tradition going back over 40 years now, of using Kripke fixed-point model constructions to show how naive schemas can be (Post) consistent, as long as one embeds in a non-classical logic. A main issue in all this research is the (...) question of finding a suitable conditional for the naive schemas, an implication connective that is well-behaved enough to be useful but weak enough to maintain coherence when there are paradoxes in the surrounding aether. Field takes several cues from the exemplary work of Ross Brady. Brady's work is predominantly concerned with models for naive theories in relevant logic. Field's considered view is that ‘relevant conditionals are just the wrong tool for naive theories’ [ibid.: 140]. In this note, I reply that a relevant conditional is an indispensable tool for at least one very important job: giving identity conditions for properties. (shrink)

Circular denitions have primarily been studied in revision theory in the classical scheme. I present systems of circular denitions in the Strong Kleene and supervaluation schemes and provide complete proof systems for them. One class of denitions, the intrinsic denitions, naturally arises in both schemes. I survey some of the features of this class of denitions.

Substructural logics and their application to logical and semantic paradoxes have been extensively studied. In the paper, we study theories of naïve consequence and truth based on a non-reflexive logic. We start by investigating the semantics and the proof-theory of a system based on schematic rules for object-linguistic consequence. We then develop a fully compositional theory of truth and consequence in our non-reflexive framework.

This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...) overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs for naïve set theory are also provided. (shrink)

This paper concerns the relationship between transitivity of entailment, omega-inconsistency and nonstandard models of arithmetic. First, it provides a cut-free sequent calculus for non-transitive logic of truth STT based on Robinson Arithmetic and shows that this logic is omega-inconsistent. It then identifies the conditions in McGee for an omega-inconsistent logic as quantified standard deontic logic, presents a cut-free labelled sequent calculus for quantified standard deontic logic based on Robinson Arithmetic where the deontic modality is treated as a predicate, proves omega-inconsistency (...) and shows thus, pace Cobreros et al., that the result in McGee does not rely on transitivity. Finally, it also explains why the omega-inconsistent logics of truth in question do not require nonstandard models of arithmetic. (shrink)

Recently, several authors have pointed out that substructural logics are adequate for developing naive theories that represent semantic concepts such as truth. Among them, three proposals have been explored: dropping cut, dropping contraction and dropping reflexivity. However, nowhere in the substructural literature has anyone proposed rejecting the structural rule of weakening, while accepting the other rules. Some theorists have even argued that this task was not possible, since weakening plays no role in the derivation of semantic paradoxes. In this article, (...) I introduce a theory for naive truth based on the logic resulting from dropping the rule of weakening from classical logic, and maintaining the other structural rules. (shrink)

Philosophy and Phenomenological Research, EarlyView.

This paper is a sequel to Beall (2011), in which I both give and discuss the philosophical import of a result for the propositional (multiple-conclusion) logic LP+. Feedback on such ideas prompted a spelling out of the first-order case. My aim in this paper is to do just that: namely, explicitly record the first-order result(s), including the collapse results for K3+ and FDE+.

A dialetheia is a sentence, A, such that both it and its negation, A, are true (we shall talk of sentences throughout this entry; but one could run the definition in terms of propositions, statements, or whatever one takes as her favourite truth bearer: this would make little difference in the context). Assuming the fairly uncontroversial view that falsity just is the truth of negation, it can equally be claimed that a dialetheia is a sentence which is both true and (...) false. (shrink)

A dialetheia is a sentence, A, such that both it and its negation, ¬A, are true (we shall talk of sentences throughout this entry; but one could run the definition in terms of propositions, statements, or whatever one takes as her favourite truth-bearer: this would make little difference in the context). Assuming the fairly uncontroversial view that falsity just is the truth of negation, it can equally be claimed that a dialetheia is a sentence which is both true and false.

What is commonly referred to as the Adoption Problem is a challenge to the idea that the principles of logic can be rationally revised. The argument is based on a reconstruction of unpublished work by Saul Kripke. As the reconstruction has it, Kripke extends the scope of Willard van Orman Quine's regress argument against conventionalism to the possibility of adopting new logical principles. In this paper we want to discuss the scope of this challenge. Are all revisions of logic subject (...) to the Adoption Problem? If not, are there significant cases of logical revision that are subject to the Adoption Problem? We will argue that both questions should be answered negatively. (shrink)