This is a completely informal presentation of the ideas behind the diagonal lemma. One really can't see this important result from too many different angles. This one aims at getting the main idea across. (For the cognoscenti, it is in the spirit of Quine's treatment in terms of "appended to its own quotation".).

In Zettel, Wittgenstein considered a modified version of Cantor’s diagonal argument. According to Wittgenstein, Cantor’s number, different with other numbers, is defined based on a countable set. If Cantor’s number belongs to the countable set, the definition of Cantor’s number become incomplete. Therefore, Cantor’s number is not a number at all in this context. We can see some examples in the form of recursive functions. The definition "f(a)=f(a)" can not decide anything about the value of f(a). The definiton is (...) incomplete. The definition of "f(a)=1+f(a)" can not decide anything about the value of f(a) too. The definiton is incomplete.<br><br>According to Wittgenstein, the contradiction, in Cantor's proof, originates from the hidden presumption that the definition of Cantor’s number is complete. The contradiction shows that the definition of Cantor’s number is incomplete. <br><br>According to Wittgenstein’s analysis, Cantor’s diagonal argument is invalid. But different with Intuitionistic analysis, Wittgenstein did not reject other parts of classical mathematics. Wittgenstein did not reject definitions using self-reference, but showed that this kind of definitions is incomplete.<br><br>Based on Thomson’s diagonal lemma, there is a close relation between a majority of paradoxes and Cantor’s diagonal argument. Therefore, Wittgenstein’s analysis on Cantor’s diagonal argument can be applied to provide a unified solution to paradoxes. (shrink)

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: From ¬(p (...) ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way as well: (...) to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense. (shrink)

A suprise may occur if we use a similar strategy to the Liar's paradox to mathematically formalize "This sentence does not contain the symbol X".

‎A universal schema for diagonalization was popularized by N. S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fit more theorems in the universal‎ ‎schema of diagonalization‎, ‎such as Euclid's proof for the infinitude of the primes and new proofs (...) of G. Boolos (1997) for Cantor's theorem on the non-equinumerosity of a set with its powerset‎. ‎Then‎, ‎in Linear Temporal Logic‎, ‎we show the non-existence of a fixed-point in this logic whose proof resembles the argument of Yablo's paradox (1985‎, ‎1993)‎. ‎Thus‎, ‎Yablo's paradox turns for the first time into a genuine mathematico-logical theorem in the framework of Linear Temporal Logic‎. ‎Again the diagonal schema of the paper is used in this proof; and it is also shown that G. Priest's inclosure schema (1997) can fit in our universal diagonal / fixed-point schema‎. ‎We also show the existence of dominating (Ackermann-like) functions (which dominate a given countable set of functions‎, ‎such as primitive recursive functions) in the schema. (shrink)

The paper continues my earlier Chat with OpenAI’s ChatGPT with a Focused LLM Experiment (FLEX). The idea is to conduct Large Language Model (LLM) based explorations of certain areas or concepts. The approach is based on crafting initial guiding prompts and then follow up with user prompts based on the LLMs’ responses. The goals include improving understanding of LLM capabilities and their limitations culminating in optimized prompts. The specific subjects explored as research subject matter include a) diagonalization techniques as practiced (...) by Cantor, Turing, Gödel, and the advances, such as the Forcing techniques introduced by Paul Cohen and later investigators, b) Knowledge Hierarchies & Mapping Exercises, c) Discussions of IJ Good’s Speculations Concerning the First Ultraintelligent Machine, AGI, and Super- intelligence. Results suggest variability between major models like ChatGPT-4, Llama-3, Cohere, Sonnet and Opus. Results also point to strong dependence on users’ preexisting knowledge and skill bases. The paper should be viewed as ’raw data’ rather than a polished authoritative reference. (shrink)

Speakers assert in order to communicate information. It is natural, therefore, to hold that the content of an assertion is whatever information it communicates to its audience. In cases involving uncertainty about the semantic values of context-sensitive lexical items, moreover, it is natural to hold that the information an assertion communicates to its audience is whatever information audience members are in a position to recover from it by assuming that the proposition it semantically determines is true. This sort of picture (...) corresponds to an influential and widely endorsed theory of assertoric content: diagonalism. I begin by arguing that, despite its intuitive appeal, diagonalism should be rejected because it conflicts with our intuitive judgments about the circumstances in which the contents of speakers’ assertions would be true or false. I then show that the failure of diagonalism requires us to either abandon a familiar way of thinking about information and rational assertion or hold that the content of an assertion is not always the information it communicates. I suggest that we choose the latter horn of this dilemma — assertoric content is better characterized in terms of the commitments speakers undertake than in terms of the information they communicate. (shrink)

These remarks take up the reflexive problematics of Being and Nothingness and related texts from a metalogical perspective. A mutually illuminating translation is posited between, on the one hand, Sartre’s theory of pure reflection, the linchpin of the works of Sartre’s early period and the site of their greatest difficulties, and, on the other hand, the quasi-formalism of diagonalization, the engine of the classical theorems of Cantor, Gödel, Tarski, Turing, etc. Surprisingly, the dialectic of mathematical logic from its inception through (...) the discovery of the diagonal theorems can be recognized as a particularly clear instance of the drama of reflection according to Sartre, especially in the positing and overcoming of its proper value-ideal, viz. the synthesis of consistency and completeness. Conversely, this translation solves a number of systematic problems about pure reflection’s relations to accessory reflection, phenomenological reflection, pre-reflective self-consciousness, conversion, and value. Negative foundations, the metaphysical position emerging from this translation between existential philosophy and metalogic, concurs by different paths with Badiou’s Being and Event in rejecting both ontotheological foundationalisms and constructivist antifoundationalisms. (shrink)

We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal (...) possibility quantifies over some point on the diagonal. Thus, they are just like the epistemic operators for apriority and its dual. We take this extension of Fitch’s familiar derivation system to be a very natural one, since the new rules and labeled lines hereby introduced preserve the structure of Fitch’s own rules for the modal case. (shrink)

In quantum theory every state can be diagonalized, i.e. decomposed as a convex combination of perfectly distinguishable pure states. This elementary structure plays an ubiquitous role in quantum mechanics, quantum information theory, and quantum statistical mechanics, where it provides the foundation for the notions of majorization and entropy. A natural question then arises: can we reconstruct these notions from purely operational axioms? We address this question in the framework of general probabilistic theories, presenting a set of axioms that guarantee that (...) every state can be diagonalized. The first axiom is Causality, which ensures that the marginal of a bipartite state is well defined. Then, Purity Preservation states that the set of pure transformations is closed under composition. The third axiom is Purification, which allows to assign a pure state to the composition of a system with its environment. Finally, we introduce the axiom of Pure Sharpness, stating that for every system there exists at least one pure effect occurring with unit probability on some state. For theories satisfying our four axioms, we show a constructive algorithm for diagonalizing every given state. The diagonalization result allows us to formulate a majorization criterion that captures the convertibility of states in the operational resource theory of purity, where random reversible transformations are regarded as free operations. (shrink)

Two-dimensional semantics, which can represent the distinction between a priority and necessity, has wielded considerable influence in the philosophy of language. In this paper, I axiomatize the dagger operator of Stalnaker’s “Assertion” in the formal context of two-dimensional modal logic. The language contains modalities of actuality, necessity, and a priority, but is also able to represent diagonalization, a conceptually important operation in a variety of contexts, including models of the relative a priori and a posteriori often appealed to Bayesian and (...) Gricean contexts. Finally, I sketch the prospects for extending this two-dimensional upgrade to other kinds of modal logics for natural language. (shrink)

In his early philosophy as well as in his middle period, Wittgenstein holds a purely syntactic view of logic and mathematics. However, his syntactic foundation of logic and mathematics is opposed to the axiomatic approach of modern mathematical logic. The object of Wittgenstein’s approach is not the representation of mathematical properties within a logical axiomatic system, but their representation by a symbolism that identifies the properties in question by its syntactic features. It rests on his distinction of descriptions and operations; (...) its aim is to reduce mathematics to operations. This paper illustrates Wittgenstein’s approach by examining his discussion of irrational numbers. (shrink)

This analysis shows Cantor's diagonal definition in his 1891 paper was not compatible with his horizontal enumeration of the infinite set M. The diagonal sequence was a counterfeit which he used to produce an apparent exclusion of a single sequence to prove the cardinality of M is greater than the cardinality of the set of integers N.

In this paper we propose to present from a new perspective some loci comunes of traditional logic. More exactly, we intend to show that some hypothetico-disjunctive inferences (i.e. the complex constructive dilemma, the complex destructive dilemma, the simple constructive dilemma, the simple destructive dilemma) and two hypothetico-categorical inferences (namely modus ponendo-ponens and modus tollendo-tollens) particularize two more abstract inferential structures: the constructive n-lemma and the destructive nlemma.

In this paper, we axiomatize the deontic logic in Fusco 2015, which uses a Stalnaker-inspired account of diagonal acceptance and a two-dimensional account of disjunction to treat Ross’s Paradox and the Puzzle of Free Choice Permission. On this account, disjunction-involving validities are a priori rather than necessary. We show how to axiomatize two-dimensional disjunction so that the introduction/elimination rules for boolean disjunction can be viewed as one-dimensional projections of more general two-dimensional rules. These completeness results help make explicit the (...) restrictions Fusco’s account must place on free-choice inferences. They are also of independent interest, as they raise difficult questions about how to ‘lift’ a Kripke frame for a one- dimensional modal logic into two dimensions. (shrink)

Following Post program, we will propose a linguistic and empirical interpretation of Gödel’s incompleteness theorem and related ones on unsolvability by Church and Turing. All these theorems use the diagonal argument by Cantor in order to find limitations in finitary systems, as human language, which can make “infinite use of finite means”. The linguistic version of the incompleteness theorem says that every Turing complete language is Gödel incomplete. We conclude that the incompleteness and unsolvability theorems find limitations in our (...) finitary tool, which is our complete language. (shrink)

Příspěvek přináší základní matematické zakotvení pojmů „teorie chaosu". Představuje klíčové vlastnosti modelů chaotického chování dynamického systému s ohledem na explanační a prediktivní sílu modelů. Z pozice filosofie vědy podrobuje analýze především reprezentační aspekty modelů chaotické dynamiky systému. Nejzajímavějším aspektem těchto modelů je přísné omezení jejich reprezentační úlohy s ohledem na splnění podmínky hyperbolicity nutné pro platnost stínového lemma.

I prove that the Boolean Prime Ideal Theorem is equivalent, under some weak set-theoretic assumptions, to what I will call the Cut-for-Formulas to Cut-for-Sets Theorem: for a set F and a binary relation |- on Power(F), if |- is finitary, monotonic, and satisfies cut for formulas, then it also satisfies cut for sets. I deduce the CF/CS Theorem from the Ultrafilter Theorem twice; each proof uses a different order-theoretic variant of the Tukey- Teichmüller Lemma. I then discuss relationships between (...) various cut-conditions in the absence of finitariness or of monotonicity. (shrink)

This paper deploys a Cantor-style diagonal argument which indicates that there is more possible mathematical content than there are propositional functions in Russell and Whitehead's Principia Mathematica and similar formal systems. This technical result raises a historical question: "How did Russell, who was himself an expert in diagonal arguments, not see this coming?" It turns out that answering this question requires an appreciation of Russell's understanding of what logic is, and how he construed the relationship between logic and (...) Principia Mathematica. (shrink)

In a recent article, Christopher Ormell argues against the traditional mathematical view that the real numbers form an uncountably infinite set. He rejects the conclusion of Cantor’s diagonal argument for the higher, non-denumerable infinity of the real numbers. He does so on the basis that the classical conception of a real number is mys- terious, ineffable, and epistemically suspect. Instead, he urges that mathematics should admit only ‘well-defined’ real numbers as proper objects of study. In practice, this means excluding (...) as inadmissible all those real numbers whose decimal expansions cannot be calculated in as much detail as one would like by some rule. We argue against Ormell that the classical realist account of the continuum has explanatory power in mathematics and should be accepted, much in the same way that "dark matter" is posited by physicists to explain observations in cosmology. In effect, the indefinable real numbers are like the "dark matter" of real analysis. (shrink)

The objective of this paper is to study algebraic properties of neutrosophic matrices, where a necessary and sufficient condition for the invertibility of a square neutrosophic matrix is presented by defining the neutrosophic determinant. On the other hand, this work introduces the concept of neutrosophic Eigen values and vectors with an easy algorithm to compute them. Also, this article finds a necessary and sufficient condition for the diagonalization of a neutrosophic matrix.

In order to explain Wittgenstein’s account of the reality of completed infinity in mathematics, a brief overview of Cantor’s initial injection of the idea into set- theory, its trajectory and the philosophic implications he attributed to it will be presented. Subsequently, we will first expound Wittgenstein’s grammatical critique of the use of the term ‘infinity’ in common parlance and its conversion into a notion of an actually existing infinite ‘set’. Secondly, we will delve into Wittgenstein’s technical critique of the concept (...) of ‘denumerability’ as it is presented in set theory as well as his philosophic refutation of Cantor’s Diagonal Argument and the implications of such a refutation onto the problems of the Continuum Hypothesis and Cantor’s Theorem. Throughout, the discussion will be placed within the historical and philosophical framework of the Grundlagenkrise der Mathematik and Hilbert’s problems. (shrink)

Chains of causes appear when the existence of God is discussed. It is claimed by some that these chains must be finite and terminated by God. But these chains seem endless through our knowledge search. This endlessness for the physical reasons for any world event expresses the greatness and complexity of God’s creation and so the transcendence of God. So, only we can put our hands on physical reasons in an endless forage for knowledge. Yet, the endlessness of the physical (...) causes chains confirms the existence of God, and this is what our paper tries using Zorn’s lemma, an equivalent for one of the most celebrated axioms of mathematics, the Axiom of Choice. (shrink)

I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...) independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility,incompleteness, the limits of computation,and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things,a non-quantum mechanical uncertainty principle and a proof of monotheism. (shrink)

No False Lemmas (NFL) says: necessarily, S’s belief that p is knowledge only if it is not inferred from any falsehood. Its proponents argue that alleged counterexamples to NFL are really cases of knowledge despite falsehood, wherein the false premise is inessential to the inference; perhaps some nearby truth does the justificatory heavy-lifting. We argue that there can be cases of inferential knowledge from a blindspot premise. Given that in such cases the relevant falsehood is essential to the inference, one (...) cannot employ the knowledge despite falsehood strategy to defend NFL. We conclude by discussing how cases of knowledge from blindspots exemplify one way in which we can gain inferential knowledge defectively or non-ideally. (shrink)

We consider a natural-language sentence that cannot be formally represented in a first-order language for epistemic two-dimensional semantics. We also prove this claim in the “Appendix” section. It turns out, however, that the most natural ways to repair the expressive inadequacy of the first-order language render moot the original philosophical motivation of formalizing a priori knowability as necessity along the diagonal.

The current literature on norms of inquiry features two families of norms: norms that focus on an inquirer’s ignorance and norms that focus on the question’s soundness. I argue that, given a factive conception of ignorance, it’s possible to derive a soundness-style norm from a version of the ignorance norm. A crucial lemma in the argument is that just as one can only be ignorant of a proposition if the proposition is true, so one can only be ignorant with (...) respect to a question if the question is sound. (shrink)

I propose a unified solution to two puzzles: Ross's puzzle and free choice permission. I begin with a pair of cases from the decision theory literature illustrating the phenomenon of act dependence, where what an agent ought to do depends on what she does. The notion of permissibility distilled from these cases forms the basis for my analysis of 'may' and 'ought'. This framework is then combined with a generalization of the classical semantics for disjunction — equivalent to Boolean disjunction (...) on the diagonal, but with a different two-dimensional character — that explains the puzzling facts in terms of semantic consequence. (shrink)

Cantor argued that absolute infinity is beyond mathematical comprehension. His arguments imply that the domain of mathematics cannot be grasped by mathematical means. We argue that this inability constitutes a foundational problem. For Cantor, however, the domain of mathematics does not belong to mathematics, but to theology. We thus discuss the theological significance of Cantor’s treatment of absolute infinity and show that it can be interpreted in terms of negative theology. Proceeding from this interpretation, we refer to the recent debate (...) on absolute generality and argue that the method of diagonalization constitutes a modern version of the vianegativa. On our reading, negative theology can evoke an attitude of humility with respect to the boundedness of the human condition. Along these lines, we think that the foundational problem of mathematics concerning its domain can be addressed through a methodological attitude of humility. (shrink)

The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This (...) undecidability result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict. (shrink)

The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework of point-free topology) (...) give rise to a profusion of topological belief operators that are compatible with the familiar topological knowledge operator. Thereby a canonical topological model for weak KB can be constructed. For this canonical model a truth lemma for the K and B holds such that a completeness theorem for KB can be proved in the familiar way. The second aim of this paper is to show that the topological interpretation of knowledge K comes along with a complete Heyting algebra of belief operators B that all fit the knowledge operator K in the sense that the pairs (K, B) satisfy all axioms of weak KB. This amounts to a pluralistic relation between knowledge and belief: Knowledge does not fully determine belief, rather it designs a conceptual space for belief operators where different (competing) belief operators coexist. (shrink)

With respect to the metaphysics of infinity, the tendency of standard debates is to either endorse or to deny the reality of ‘the infinite’. But how should we understand the notion of ‘reality’ employed in stating these options? Wittgenstein’s critical strategy shows that the notion is grounded in a confusion: talk of infinity naturally takes hold of one’s imagination due to the sway of verbal pictures and analogies suggested by our words. This is the source of various philosophical pictures that (...) in turn give rise to the standard metaphysical debates: that the mathematics of infinity corresponds to a special realm of infinite objects, that the infinite is profoundly huge or vast, or that the ability to think about infinity reveals mysterious powers in human beings. First, I explain Wittgenstein’s general strategy for undermining philosophical pictures of ‘the infinite’ – as he describes it in Zettel; and then show how that critical strategy is applied to Cantor’s diagonalization proof in Remarks on the Foundations of Mathematics II. (shrink)

It may be a myth that Plato wrote over the entrance to the Academy “Let no-one ignorant of geometry enter here.” But it is a well-chosen motto for his view in the Republic that mathematical training is especially productive of understanding in abstract realms, notably ethics. That view is sound and we should return to it. Ethical theory has been bedevilled by the idea that ethics is fundamentally about actions (right and wrong, rights, duties, virtues, dilemmas and so on). That (...) is an error like the one Plato mentions of thinking mathematics is about actions (of adding, constructing, extracting roots and so on). Mathematics is about eternal relations between universals, such as the ratio of the diagonal of a square to the side. Ethics too is about eternal verities, such as the equal worth of persons and just distributions. Mathematical and ethical verities do both constrain actions, such as the possibility of walking over the seven bridges of Königsberg once and once only or of justly discriminating between races. But they are not themselves about action. In principle, neither mathematical nor ethical verities are subject to historical forces or disagreement among tribes (though they can be better understood as time goes on). Plato is right: immersion in mathematics induces an understanding of the necessities underpinning reality, an understanding that is essential for distinguishing objective ethics from tribal custom. Equality, for example, is an abstract concept which is foundational for both mathematics and ethics. (shrink)

I here investigate the sense in which diagonalization allows one to construct sentences that are self-referential. Truly self-referential sentences cannot be constructed in the standard language of arithmetic: There is a simple theory of truth that is intuitively inconsistent but is consistent with Peano arithmetic, as standardly formulated. True self-reference is possible only if we expand the language to include function-symbols for all primitive recursive functions. This language is therefore the natural setting for investigations of self-reference.

I this paper I give minimal axioms for the ontology of time, especially A-theories and B-theories and I derive philosophically interesting lemmas. The exercise is set-theoretical, defining all notions and indicating assumptions and philosophical points of disagreement, while being easy to translate to other formal expressions . The issue of a logic for A-theories of time is treated towards the end, where I sketch ‘copresent’ operators for capturing the idea of temporal passage. The main conclusion will be that, while circularity (...) threatens both families of theories, the growing block theory (belonging to the A-theory) is the least objectionable philosophically. (shrink)

In his “A new argument for evidentialism” (Shah, Philos Q 56(225): 481–498, 2006 ), Nishi Shah argues that the best explanation of a feature of deliberation whether to believe that p which he calls transparency entails that only evidence can be reason to believe that p. I show that his argument fails because a crucial lemma that his argument appeals to cannot be supported without assuming evidentialism to be true in the first place.

This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (2005), and the dependence digraph by Beringer & Schindler (2015). Unlike the usual discussion about self-reference of paradoxes centering around Yablo's paradox and its variants, I focus on the paradoxes of finitary characteristic, which are given again by use of Leitgeb's dependence relation. They are called 'locally finite paradoxes', satisfying that any sentence in these paradoxes can depend on finitely many sentences. I prove (...) that all locally finite paradoxes are self-referential in the sense that there is a directed cycle in their dependence digraphs. This paper also studies the 'circularity dependence' of paradoxes, which was introduced by Hsiung (2014). I prove that the locally finite paradoxes have circularity dependence in the sense that they are paradoxical only in the digraph containing a proper cycle. The proofs of the two results are based directly on König's infinity lemma. In contrast, this paper also shows that Yablo's paradox and its nested variant are non-self-referential, and neither McGee's paradox nor the omega-cycle liar paradox has circularity dependence. (shrink)

We here make preliminary investigations into the model theory of DeMorgan logics. We demonstrate that Łoś's Theorem holds with respect to these logics and make some remarks about standard model-theoretic properties in such contexts. More concretely, as a case study we examine the fate of Cantor's Theorem that the classical theory of dense linear orderings without endpoints is $\aleph_{0}$-categorical, and we show that the taking of ultraproducts commutes with respect to previously established methods of constructing nonclassical structures, namely, Priest's Collapsing (...) Lemma and Dunn's Theorem in 3-Valued Logic. (shrink)

In this paper I put forward a representationalist theory of conscious experience based on Robert Stalnaker's version of two-dimensional modal semantics. According to this theory the phenomenal character of an experience correlates with a content equivalent to what Stalnaker calls the diagonal proposition. I show that the theory is closely related both to functionalist theories of consciousness and to higher-order representational theories. It is also more compatible with an anti-Cartesian view of the mind than standard representationalist theories.

Epistemicists claim that vague predicates have precise but unknow- able cutoffs. I argue against against the standard, Williamsonian, answer, that appeals to metalinguistic safety: we can know that p even if our true belief that p is metalinguistically lucky. I then propose that epistemicists should be diagonalized epistemicists and show how this alternative formulation of the view avoids the chal- lenge. However, in an M. Night Shyamalan-style twist, I then argue we should not be diagonalized epistemicists either.

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional logic (...) with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn Yablo's paradox, the most challenging paradox in the recent years, into a genuine mathematical theorem in Linear Temporal Logic (LTL). Indeed, Yablo's paradox comes in several varieties; and he showed in 2004 that there are other versions that are equally paradoxical. Formalizing these (...) versions of Yablo's paradox, we prove some theorems in LTL. This is the first time that Yablo's paradox(es) become new(ly discovered) theorems in mathematics and logic. (shrink)

Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we (...) show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators. (shrink)

The copy provided on ths site is a late draft. It provides a philosophical argument for the view that by and large it is morally wrong to buy shares in a company that is behaving badly unless you (if necessary acting together with others) are able and willing to prevent the misbehaviour. A key lemma in my argument concerns a chain of authorisation from the shareholders to the company's board to the CEO -- one in virtue of which shareholders (...) are ultimately responsible for major patterns of wrongdoing by the company. (shrink)

From my ongoing "Metalogical Plato" project. The aim of the diagram is to make reasonably intuitive how the Socratic elenchos (the logic of refutation applied to candidate formulations of virtues or ruling knowledges) looks and works as a whole structure. This is my starting point in the project, in part because of its great familiarity and arguable claim to being the inauguration of western philosophy; getting this point less wrong would have broad and deep consequences, including for philosophy’s self-understanding. -/- (...) (i.) is the first pass at elenchos in which the Socratic interlocutor does not reflect on knowledge being the crux of the problem. (ii.) is the second, rarer, reflective pass in which they are, making the investigation explicitly about knowledge. Its centrality in the Charmides makes that neglected dialogue of superlative importance. This structure is also the gateway through which the discussion/dialectic crosses into the Agathology (discussion of the form of the good) at Republic 505. -/- The problem of elenchos, then, grasped as a whole structure, is that it seems that knowledge can neither satisfactorily be included in nor excluded from its own scope. The development of the ti esti (“what is ---?”) question leads to the introduction of knowledge into its own scope (i. implicitly, as goodness contrasted with blind rule-following ii. explicitly qua knowledge) while the development of the dual peri tinos (“----about what?) question leads to K’s elimination from its own scope. The introductions are motivated to avoid contradiction, but produce regress; the eliminations are motivated to avoid regress, but produce contradiction. In scholarship, and in the history of philosophy, the ti esti question is universally recognized, to the point of being identified with philosophy’s origin and essence; the peri tinos question is neglected textually and never recognized as the equal dual to the ti esti. This, I claim, has blocked the development of a nontrivial logical appreciation of what Plato's Socrates is up to. (One rather disastrous effect of this neglect is taking Aristotle as the beginning of the development of logic, rather than, correctly, for the beginning of logic’s fatal separation from mathematics and dialectic.) -/- Further, because of this monopticism of the ti esti, the function of consistency in the elenchos has not been understood, even with respect to the ti esti. The ti esti is actually in search of completeness, given a norm of consistency; the peri tinos is in search of consistency, given a norm of completeness. Only appreciating the two questions as dual allows space in the structure to clarify these different orientations relative to consistency. (And, dually, to completeness, whose function in the elenchos is generally entirely missed by scholars and relegated to discussions of eros; it's not out of place there, of course, but its significance is secured here.) Recognizing the duality of the ti esti and peri tinos questions is thus the royal road, in the Socratic-Platonic context, to catching sight of what we post-Cantorians can recognize as the metalogical duality of consistency and completeness. (The salutary disruptive effects of this Plato-Cantor proximity have, of course, been traced in complementary ways by Badiou.) -/- Note that the diagram is supposed to provide a relatively accessible orientation, not to stand on its own, and certainly not to be the last word on any subject. An important qualification (telegraphed in the previous paragraph) is that what elenchos shows is not finally circular or paradoxical, though the problem first presents as such (stubbornly, obdurately, as "difficult" Plato's Socrates always says with characteristic understatement). What is depicted here is meant, at a first pass, to be the shape of that first presentation, the form of the problem of elenchos, rather than of its solution. It's not an accident that this problem strongly resembles "Russell's paradox" (not Russell's not a paradox.) Problem is to solution as RP is to the diagonal theorems. (shrink)

In this book, the authors introduce the linguistic set associated with a linguistic variable and the structure of matrices, which they define as linguistic matrices. The authors build linguistic matrices only for those linguistic variables which yield a linguistic continuum or an ordered linguistic set. This book is organised into three chapters. The first chapter is introductory, in which we introduce all the basic concepts of linguistic variables and the associated linguistic set to make this book self-contained. Chapter two introduces (...) linguistic matrices and develops basic properties associated with them, like types of matrices, transpose of matrices and diagonal matrices. Most of the properties enjoyed by real or complex matrices are satisfied by these linguistic matrices. Chapter three deals with operations on the linguistic matrices. (shrink)

Frege developed the theory of sense and reference while composing his Grundgesetze and considering its philosophical implications. The Grundgesetze is thus the most important test case for the application of this theory of meaning. I argue that evidence internal and external to the Grundgesetze suggests that he thought of senses as having a structure isomorphic to the Grundgesetze expressions that would be used to express them, which entails a theory about the identity conditions of senses that is relatively fine-grained, though (...) still coarser than some other commentators have suggested. While this interpretation does not make Frege’s ontological commitment to the denizens of a “third realm” as profligate as some have alleged, it is sufficiently bloated to lead to Cantorian paradoxes and diagonal contradictions independent of his Basic Law V. (shrink)

The paradox of rule-following that Saul Kripke finds in Wittgenstein’s Philosophical Investigations purports to show that words and thoughts have no content—that there is no intentionality. This paper refutes the paradox with a dilemma. Intentional states are posited in rational explanations, which use propositional attitudes to explain actions and thoughts. Depending on which of the two plausible views of rational explanation is right, either: the paradox is mistaken about the a priori requirements for content; or, a fatal flaw in content (...) ascription alleged by the paradox is not a flaw at all, but a necessary component of the proper method of propositional-attitude ascription. On either lemma, rational explanation defuses the paradox. (shrink)