Syntactic Proofs for Yablo’s Paradoxes in Temporal Logic

Temporal logic is of importance in theoretical computer science for its application in formal verification, to state requirements of hardware or software systems. Linear temporal logic is an appropriate logical environment to formalize Yablo’s paradox which is seemingly non-self-referential and basically has a sequential structure. We give a brief review of Yablo’s paradox and its various versions. Formalization of these paradoxes yields some theorems in Linear Temporal Logic (LTL) for which we give syntactic proofs using an appropriate axiomatization of LTL

A Yabloesque paradox in epistemic game theory

The Brandenburger–Keisler paradox is a self-referential paradox in epistemic game theory which can be viewed as a two-person version of Russell’s Paradox. Yablo’s Paradox, according to its author, is a non-self referential paradox, which created a significant impact. This paper gives a Yabloesque, non-self-referential paradox for infinitary players within the context of epistemic game theory. The new paradox advances both the Brandenburger–Keisler and Yablo results. Additionally, the paper constructs a paraconsistent model satisfying the paradoxical statement

A Yabloesque paradox in epistemic game theory

The Brandenburger–Keisler paradox is a self-referential paradox in epistemic game theory which can be viewed as a two-person version of Russell’s Paradox. Yablo’s Paradox, according to its author, is a non-self referential paradox, which created a significant impact. This paper gives a Yabloesque, non-self-referential paradox for infinitary players within the context of epistemic game theory. The new paradox advances both the Brandenburger–Keisler and Yablo results. Additionally, the paper constructs a paraconsistent model satisfying the paradoxical statement

Imaginative Resistance and Modal Knowledge

Readers of fictions sometimes resist taking certain kinds of claims to be true according to those fictions, even when they appear explicitly or follow from applying ordinary principles of interpretation. This "imaginative resistance" is often taken to be significant for a range of philosophical projects outside aesthetics, including giving us evidence about what is possible and what is impossible, as well as the limits of conceivability, or readers' normative commitments. I will argue that this phenomenon cannot do the theoretical work that has been asked of it. Resistance to taking things to be fictional is often best explained by unfamiliarity with kinds of fictions than any representational, normative, or cognitive limits. With training and experience, any understandable proposition can be made fictional and be taken to be fictional by readers. This requires a new understanding both of imaginative resistance, and what it might be able to tell us about topics like conceivability or the bounds of possibility

On Artifacts and Truth-Preservation

In Saving Truth from Paradox, Hartry Field presents and defends a theory of truth with a new conditional. In this paper, I present two criticisms of this theory, one concerning its assessments of validity and one concerning its treatment of truth-preservation claims. One way of adjusting the theory adequately responds to the truth-preservation criticism, at the cost of making the validity criticism worse. I show that in a restricted setting, Field has a way to respond to the validity criticism. I close with some general considerations on the use of revision-theoretic methods in theories of truth

Partial Truth: An Open Problem

Di recente la nozione di verità parziale ha attirato l'attenzione di filosofi e logici. Questa nota presenta brevemente un problema che una teoria della verità parziale deve risolve e discute alcuni tentativi di soluzione.The notion of partial truth has recently attracted the attention of philosophers and logicians. This note briefly presents a puzzle that an account of partial truth must solve and discusses some attempted solutions

Yablo's Paradox in Second-Order Languages: Consistency and Unsatisfiability

Stephen Yablo [23,24] introduces a new informal paradox, constituted by an infinite list of semi-formalized sentences. It has been shown that, formalized in a first-order language, Yablo's piece of reasoning is invalid, for it is impossible to derive falsum from the sequence, due mainly to the Compactness Theorem. This result casts doubts on the paradoxical character of the list of sentences. After identifying two usual senses in which an expression or set of expressions is said to be paradoxical, since second-order languages are not compact, I study the paradoxicality of Yablo's list within these languages. While non-paradoxical in the first sense, the second-order version of the list is a paradox in our second sense. I conclude that this suffices for regarding Yablo's original list as paradoxical and his informal argument as valid.Fil: Picollo, Lavinia María. Universidad de Buenos Aires. Facultad de Filosofía y Letras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin

Explanation, Extrapolation, and Existence

Mark Colyvan (2010) raises two problems for ‘easy road’ nominalism about mathematical objects. The first is that a theory’s mathematical commitments may run too deep to permit the extraction of nominalistic content. Taking the math out is, or could be, like taking the hobbits out of Lord of the Rings. I agree with the ‘could be’, but not (or not yet) the ‘is’. A notion of logical subtraction is developed that supports the possibility, questioned by Colyvan, of bracketing a theory’s mathematical aspects to obtain, as remainder, what it says ‘mathematics aside’. The other problem concerns explanation. Several grades of mathematical involvement in physical explanation are distinguished, by analogy with Quine’s three grades of modal involvement. The first two grades plausibly obtain, but they do not require mathematical objects. The third grade is likelier to require mathematical objects. But it is not clear from Colyvan’s example that the third grade really obtains

truthmakers for 1st order sentences - a proposal

The purpose of this paper is to communicate - as a proposal - a general method of assigning a 'truthmaker' to any 1st order sentence in each of its models. The respective construct is derived from the standard model theoretic (recursive) satisfaction definition for 1st order languages and is a conservative extension thereof. The heuristics of the proposal (which has been somewhat idiosyncratic from the current point of view) and some more technical detail of the construction may be found in my article on part I of Spinoza's `ethica, ordine geometrico demonstrata', which is the context within which I elaborated the assignment. But this context need not be repeated here, the presentation of the truthmaker assignment will be comprehensible to anybody with solid basic knowledge in 1st order model theory, anything used is standard and no advanced techniques are required