In the first part of this investigation we highlight two, seemingly irreconcilable, beliefs that suggest an impending crisis in the teaching, research, and practice of—primarily state-supported—mathematics: (a) the belief, with increasing, essentially faith-based, conviction and authority amongst academics that first-order Set Theory can be treated as the lingua franca of mathematics, since its theorems—even if unfalsifiable—can be treated as ‘knowledge’ because they are finite proof sequences which are entailed finitarily by self-evidently Justified True Beliefs; and (b) (...) the slowly emerging, but powerfully rooted in economic imperatives, belief that only those Justified True Beliefs can be treated as ‘knowledge’ which are, further, categorically communicable as Factually Grounded Beliefs—hence as comprehensible pre-formal ‘mathematical truths’—by any intelligence that lays claims to a mathematical lingua franca. We argue that this seeming irreconcilability merely reflects a widening chasm between an increasing under-estimation of the value to society of ‘semantic arithmetical truth’, and an increasing over-estimation of the value to society of ‘syntactic set-theoretical provability’; a chasm which must be narrowed and bridged explicitly. We thus proffer a Complementarity Thesis which seeks to recognize that mathematical ‘provability’ and mathematical ‘truth’ need to be interdependent and complementary, ‘evidence-based’, assignments-by-convention to the formulas of a formal mathematical language; where (a) the goal of mathematical ‘proofs’ may be viewed as seeking to ensure that any mathematical language intended to formally represent our pre-formal conceptual metaphors and their inter-relatedness is unambiguous, and free from contradiction; whilst (b) the goal of mathematical ‘truths’ must be viewed as seeking to ensure that any such representation does, indeed, uniquely identify and adequately represent such metaphors and their inter-relatedness. Our thesis is that, by universally ignoring the need to introduce goal (b) in our curriculum, the teaching of, and research in, mathematics at the post-graduate level cannnot justify its value to society beyond the mere intellectual stimulation of individual minds. In the second part we appeal to some recent—and hitherto unsuspected—unarguably constructive Tarskian interpretations, of the first-order Peano Arithmetic PA, which establish PA as both finitarily consistent, and categorical. Since we also show that the second order subsystem ACA0 of Peano Arithmetic and PA cannot both be assumed provably consistent, we conclude that there can be no mathematical, or meta-mathematical, proof of consistency for Set Theory. Hence the theorems of any Set Theory are not sufficient for distinguishing between (i) what we can believe to be a ‘mathematical truth’; (ii) what we can evidence as a ‘mathematical truth’; and (iii) what we ought not to believe is a ‘mathematical truth’; whilst the theorems of the first-order Peano Arithmetic PA are sufficient for distinguishing between (i), (ii) and (iii). We conclude from this that the holy grail of mathematics ought to be ‘arithmetical truth’, not ‘set-theoretical proof’. (shrink)

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all the (...) axioms of ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

We adjust the notion of typicality originated with Russell, which was introduced and studied in a previous paper for general first-order structures, to make it expressible in the language of set theory. The adopted definition of the class ${\rm NT}$ of nontypical sets comes out as a natural strengthening of Russell's initial definition, which employs properties of small (minority) extensions, when the latter are restricted to the various levels $V_\zeta$ of $V$. This strengthening leads to defining ${\rm (...) NT}$ as the class of sets that belong to some countable ordinal definable set. It follows that ${\rm OD}\subseteq {\rm NT}$ and hence ${\rm HOD}\subseteq {\rm HNT}$. It is proved that the class ${\rm HNT}$ of hereditarily nontypical sets is an inner model of ${\rm ZF}$. Moreover the (relative) consistency of $V\neq {\rm NT}$ is established, by showing that in many forcing extensions $M[G]$ the generic set $G$ is a typical element of $M[G]$, a fact which is fully in accord with the intuitive meaning of typicality. In particular it is consistent that there exist continuum many typical reals. In addition it follows from a result of Kanovei and Lyubetsky that ${\rm HOD}\neq {\rm HNT}$ is also relatively consistent. In particular it is consistent that ${\cal P}(\omega)\cap {\rm OD}\subsetneq{\cal P}(\omega)\cap {\rm NT}$. However many questions remain open, among them the consistency of ${\rm HOD}\neq {\rm HNT}\neq V$, ${\rm HOD}={\rm HNT}\neq V$ and ${\rm HOD}\neq {\rm HNT}= V$. (shrink)

The incompleteness of set theory ZF C leads one to look for natural nonconservative extensions of ZF C in which one can prove statements independent of ZF C which appear to be “true”. One approach has been to add large cardinal axioms.Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski-Grothendieck set theory T G or It is a nonconservative extension of ZF C and is obtained from other axiomatic set theories by the (...) inclusion of Tarski’s axiom which implies the existence of inaccessible cardinals. See also related set theory with a filter quantifier ZF (aa). In this paper we look at a set theory NC# ∞# , based on bivalent gyper infinitary logic with restricted Modus Ponens Rule In this paper we deal with set theory NC# ∞# based on bivalent gyper infinitary logic with Restricted Modus Ponens Rule. Nonconservative extensions of the canonical internal set theories IST and HST are proposed. (shrink)

In this paper a class of languages which are formal enough for mathematical reasoning is introduced. Its languages are called mathematically agreeable. Languages containing a given MA language L, and being sublanguages of L augmented by a monadic predicate, are constructed. A mathematical theory of truth (shortly MTT) is formulated for some of those languages. MTT makes them fully interpreted MA languages which posses their own truth predicates. MTT is shown to conform well with the eight norms formulated for (...) theories of truth in the paper 'What Theories of Truth Should be Like (but Cannot be)', by Hannes Leitgeb. MTT is also free from infinite regress, providing a proper framework to study the regress problem. Main tools used in proofs are Zermelo-Fraenkel (ZF) set theory and classical logic. (shrink)

I consider the first-order modal logic which counts as valid those sentences which are true on every interpretation of the non-logical constants. Based on the assumptions that it is necessary what individuals there are and that it is necessary which propositions are necessary, Timothy Williamson has tentatively suggested an argument for the claim that this logic is determined by a possible world structure consisting of an infinite set of individuals and an infinite set of worlds. He notes that (...) only the cardinalities of these sets matters, and that not all pairs of infinite sets determine the same logic. I use so-called two-cardinal theorems from model theory to investigate the space of logics and consequence relations determined by pairs of infinite sets, and show how to eliminate the assumption that worlds are individuals from Williamson’s argument. (shrink)

A theory of truth is introduced for a first--order language L of set theory. Fully interpreted metalanguages which contain their truth predicates are constructed for L. The presented theory is free from infinite regress, whence it provides a proper framework to study the regress problem. Only ZF set theory, concepts definable in L and classical two-valued logic are used.

A possible world is a junky world if and only if each thing in it is a proper part. The possibility of junky worlds contradicts the principle of general fusion. Bohn (2009) argues for the possibility of junky worlds, Watson (2010) suggests that Bohn‘s arguments are flawed. This paper shows that the arguments of both authors leave much to be desired. First, relying on the classical results of Cantor, Zermelo, Fraenkel, and von Neumann, this paper proves the possibility of (...) junky worlds for certain weak set theories. Second, the paradox of Burali-Forti shows that according to the Zermelo-Fraenkel set theory ZF, junky worlds are possible. Finally, it is shown that set theories are not the only sources for designing plausible models of junky worlds: Topology (and possibly other "algebraic" mathematical theories) may be used to construct models of junky worlds. In sum, junkyness is a relatively widespread feature among possible worlds. (shrink)

In this paper paraconsistent first-order logic LP^{#} with infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^{#} is discussed.Axiomatical system HST^{#}as paraconsistent generalization of Hrbacek set theory HST is considered.

Often ZF practice includes the use of the meta-theoretical notion of classes as shorthand expressions or in order to simplify the understanding of conceptual resources. NBG theory expresses formally the internalization of this feature in set theory; in this case, classes, before used metatheoretically, will also be captured by quantifiers of the first order theory. Never- theless there is a widespread opinion that this internalization of classes is harmless. In this context, it is common (...) to refer to the conservativeness of NBG in relation to ZF as a sufficient condition to understand those theories as “equivalent”, attributing a sense of virtuality to the use of classes quantified in NBG. We believe, however, that a technique used to estab- lish relationships between theories is not necessarily neutral in relation to its results - so a conservativeness established through models have different meaning and depth of that rela- tionship established by finitary interpretations. We believe, therefore, that the way in which relationships between theories are established influences the analysis result. In the case of the relationship between NBG and ZF, since NBG is finitely axiomatizible and ZF not, we believe that we have sufficient reasons to assert that the use of different analysis tools may re- veal differences such as expressiveness, ontological commitment and logical conservativeness. Therefore, this project aims to clarify the relationship between these two theories through triangulations between them and the different analysis tools. The use of finitary techniques, in this case, may prove greater expressiveness and ontological commitment of NBG in relation to ZF - relation obscured by an infinitary approach. We believe that, through this research, we can contribute to the debate on the basis of mathematics, denaturalizing the supposedly “equivalent” use of NBG and ZF for this purpose. (shrink)

The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition (...) for granting the Gödel incompleteness statement to be a theorem just as the statement itself, to be an axiom. Then, the “completeness paper” can be interpreted as relevant to Hilbert mathematics, according to which mathematics and reality as well as arithmetic and set theory are rather entangled or complementary rather than mathematics to obey reality able only to create models of the latter. According to that, both papers (1930; 1931) can be seen as advocating Russell’s logicism or the intensional propositional logic versus both extensional arithmetic and set theory. Reconstructing history of philosophy, Aristotle’s logic and doctrine can be opposed to those of Plato or the pre-Socratic schools as establishing ontology or intensionality versus extensionality. Husserl’s phenomenology can be analogically realized including and particularly as philosophy of mathematics. One can identify propositional logic and set theory by virtue of Gödel’s completeness theorem (1930: “Satz VII”) and even both and arithmetic in the sense of the “compactness theorem” (1930: “Satz X”) therefore opposing the latter to the “incompleteness paper” (1931). An approach identifying homomorphically propositional logic and set theory as the same structure of Boolean algebra, and arithmetic as the “half” of it in a rigorous construction involving information and its unit of a bit. Propositional logic and set theory are correspondingly identified as the shared zero-order logic of the class of all first-order logics and the class at issue correspondingly. Then, quantum mechanics does not need any quantum logics, but only the relation of propositional logic, set theory, arithmetic, and information: rather a change of the attitude into more mathematical, philosophical, and speculative than physical, empirical and experimental. Hilbert’s epsilon calculus can be situated in the same framework of the relation of propositional logic and the class of all mathematical theories. The horizon of Part III investigating Hilbert mathematics (i.e. according to the Pythagorean viewpoint about the world as mathematical) versus Gödel mathematics (i.e. the usual understanding of mathematics as all mathematical models of the world external to it) is outlined. (shrink)

In 1942 Haskell B. Curry presented what is now called Curry's paradox which can be found in a logic independently of its stand on negation. In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Curry’s Paradox and Shaw-Kwei' sparadox without rejection any contraction postulate is proposed. In additional relevant paraconsistent logic C ̌_n^#,1≤n<ω, in fact,provide an effective way of circumventing triviality of da Costa’s paraconsistent Set Theories〖NF〗n^C.

ABSTRACT Theories of sets such as Zermelo Fraenkel set theory are usually presented as the combination of two distinct kinds of principles: logical and set-theoretic principles. The set-theoretic principles are imposed ‘on top’ of first-order logic. This is in agreement with a traditional view of logic as universally applicable and topic neutral. Such a view of logic has been rejected by the intuitionists, on the ground that quantification over infinite domains requires the use of intuitionistic rather than (...) classical logic. In the following, I consider constructive set theories, which use intuitionistic rather than classical logic, and argue that they manifest a distinctive interdependence or an entanglement between sets and logic. In fact, Martin-Löf type theory identifies fundamental logical and set-theoretic notions. Remarkably, one of the motivations for this identification is the thought that classical quantification over infinite domains is problematic, while intuitionistic quantification is not. The approach to quantification adopted in Martin-Löf’s type theory is subtly interconnected with its predicativity. I conclude by recalling key aspects of an approach to predicativity inspired by Poincaré, which focuses on the issue of correct quantification over infinite domains and relate it back to Martin-Löf type theory. (shrink)

On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and (...) a natural extension of BLT is definitionally equivalent with ZF. (shrink)

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)

Interesting as they are by themselves in philosophy and mathematics, paradoxes can be made even more fascinating when turned into proofs and theorems. For example, Russell’s paradox, which overthrew Frege’s logical edifice, is now a classical theorem in set theory, to the effect that no set contains all sets. Paradoxes can be used in proofs of some other theorems—thus Liar’s paradox has been used in the classical proof of Tarski’s theorem on the undefinability of truth in sufficiently rich languages. (...) This paradox (as well as Richard’s paradox) appears implicitly in Gödel’s proof of his celebrated first incompleteness theorem. In this paper, we study Yablo’s paradox from the viewpoint of first- and second-order logics. We prove that a formalization of Yablo’s paradox (which is second order in nature) is non-first-orderizable in the sense of George Boolos (1984). (shrink)

Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these (...) classes of trees in terms of the first-order theory of the generating class C, and indicate the problems obstructing such general results for the other classes. These problems arise from the possible existence of nondefinable paths in trees, that need not satisfy the first-order theory of C, so we have started analysing first order definable and undefinable paths in trees. (shrink)

An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. The audience is undergraduate students with some background in formal logic.

In this paper we view the first order set theory ZFC under the canonical frst order semantics and the second order set theory ZFC_2 under the Henkin semantics. Main results are: (i) Let M_st^ZFC be a standard model of ZFC, then ¬Con(ZFC + ∃M_st^ZFC ). (ii) Let M_stZFC_2 be a standard model of ZFC2 with Henkin semantics, then ¬Con(ZFC_2 +∃M_stZFC_2). (iii) Let k be inaccessible cardinal then ¬Con(ZFC + ∃κ). In order to obtain (...) the statements (i) and (ii) examples of the inconsistent countable set in a set theory ZFC + ∃M_stZFC and in a set theory ZFC2 + ∃M_st^ZFC_2 were derived. It is widely believed that ZFC + ∃M_stZFC and ZFC_2 + ∃M_st^ZFC_2 are consistent, i.e. ZFC and ZFC_2 have a standard models. Unfortunately this belief is wrong. Book. Advances in Mathematics and Computer Science Vol. 1 Chapter 3 There is No Standard Model of ZFC and ZFC2 ISBN-13 (15) 978-81-934224-1-0 See Part II of this paper DOI: 10.4236/apm.2019.99034 . (shrink)

The syllogistic figures and moods can be taken to be argument schemata as can the rules of the Stoic propositional logic. Sentence schemata have been used in axiomatizations of logic only since the landmark 1927 von Neumann paper [31]. Modern philosophers know the role of schemata in explications of the semantic conception of truth through Tarski’s 1933 Convention T [42]. Mathematical logicians recognize the role of schemata in first-order number theory where Peano’s second-order Induction Axiom is (...) approximated by Herbrand’s Induction-Axiom Schema [23]. Similarly, in first-order set theory, Zermelo’s second-order Separation Axiom is approximated by Fraenkel’s first-order Separation Schema [17]. In some of several closely related senses, a schema is a complex system having multiple components one of which is a template-text or scheme-template, a syntactic string composed of one or more “blanks” and also possibly significant words and/or symbols. In accordance with a side condition the template-text of a schema is used as a “template” to specify a multitude, often infinite, of linguistic expressions such as phrases, sentences, or argument-texts, called instances of the schema. The side condition is a second component. The collection of instances may but need not be regarded as a third component. The instances are almost always considered to come from a previously identified language (whether formal or natural), which is often considered to be another component. This article reviews the often-conflicting uses of the expressions ‘schema’ and ‘scheme’ in the literature of logic. It discusses the different definitions presupposed by those uses. And it examines the ontological and epistemic presuppositions circumvented or mooted by the use of schemata, as well as the ontological and epistemic presuppositions engendered by their use. In short, this paper is an introduction to the history and philosophy of schemata. (shrink)

Hannes Leitgeb formulated eight norms for theories of truth in his paper [5]: `What Theories of Truth Should be Like (but Cannot be)'. We shall present in this paper a theory of truth for suitably constructed languages which contain the first-order language of set theory, and prove that it satisfies all those norms.

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.

Hilary Putnam once suggested that “the actual existence of sets as ‘intangible objects’ suffers… from a generalization of a problem first pointed out by Paul Benacerraf… are sets a kind of function or are functions a sort of set?” Sadly, he did not elaborate; my aim, here, is to do so on his behalf. There are well-known methods for treating sets as functions and functions as sets. But these do not raise any obvious philosophical or foundational puzzles. For that, (...) we first need to provide a full-fledged function theory. I supply such a theory: it axiomatizes the iterative notion of function in exactly the same sense that ZF axiomatizes the iterative notion of set. Indeed, this function theory is synonymous with ZF. It might seem that set theory and function theory present us with rival foundations for mathematics, since they postulate different ontologies. But appearances are deceptive. Set theory and function theory provide the very same judicial foundation for mathematics. They do not supply rival metaphysical foundations; indeed, if they supply metaphysical foundations at all, then they supply the very same metaphysical foundations. (shrink)

In this paprer a class of so called mathematically acceptable (shortly MA) languages is introduced First-order formal languages containing natural numbers and numerals belong to that class. MA languages which are contained in a given fully interpreted MA language augmented by a monadic predicate are constructed. A mathematical theory of truth (shortly MTT) is formulated for some of these languages. MTT makes them fully interpreted MA languages which posses their own truth predicates, yielding consequences to philosophy of (...) mathematics. MTT is shown to conform well with the eight norms presented for theories of truth in the paper 'What Theories of Truth Should be Like (but Cannot be)' by Hannes Leitgeb. MTT is also free from infinite regress, providing a proper framework to study the regress problem. (shrink)

In this paper, I present what I call the symmetry conception of God within 1st order, extensional, non-well-founded set theory. The symmetry conception comes in two versions. According to the first, God is that unique being that is universally symmetrical with respect to set membership. According to the second, God is the universally symmetrical set of all sets that are universally symmetrical with respect to set membership. I present a number of theorems, most importantly that any universally (...) symmetrical set is identical to its essence, that show that the two symmetry conceptions intersect with some dominant theological conceptions of God. The theorems also show that both of the symmetry conceptions of God entail that God has a fractal like structure. (shrink)

Some philosophers argue that a theory of logical validity should not interpret its own language, because a Russellian argument shows that self-applicability is inconsistent with the ability to capture all the interpretations of its own language. First, I set up a formal system to examine the Russellian argument. I then defend the need for self-applicability. I argue that self-applicability seems to be implied by generality, and that the Russellian argument rests on a test for meaning that is biased (...) against self-applicability. I propose an alternative test which is unproblematic for self-applicability. I conclude that self-applicability can be vindicated and the Russellian argument can be resisted. (shrink)

In this article, we analyse the ontological import of adding classes to set theories. We assume that this increment is well represented by going from ZF system to NBG. We thus consider the standard techniques of reducing one system to the other. Novak proved that from a model of ZF we can build a model of NBG (and vice versa), while Shoenfield have shown that from a proof in NBG of a set-sentence we can generate a proof in ZF of (...) the same formula. We argue that the first makes use of a too strong metatheory. Although meaningful, this symmetrical reduction does not equate the ontological content of the theories. The strong metatheory levels the two theories. Moreover, we will modernize Shoenfields proof, emphasizing its relation to Herbrands theorem and that it can only be seen as a partial type of reduction. In contrast with symmetrical reductions, we believe that asymmetrical relations are powerful tools for comparing ontological content. In virtue of this, we prove that there is no interpretation of NBG in ZF, while NBG trivially interprets ZF. This challenges the standard view that the two systems have the same ontological content. (shrink)

I build on Adam Smith’s account of the impartial spectator in The Theory of Moral Sentiments in order to offer a modest ideal observer theory of moral judgment that is adequate in the following sense: the account specifies the hypothetical conditions that guarantee the authoritativeness of an agent’s (or agents’) responses in constituting the standard in question, and, if an actual agent or an actual community of agents are not under those conditions, their responses are not authoritative (...) in setting this standard. However, in the account that I provide, the hypothetical conditions can themselves be constructed from the psychology and interactions of actual human beings. In other words, facts about the morally appropriate and inappropriate are determined from hypothetical conditions that––while agents in a given society might have yet to attain them––can be constructed from those agents’ shared experiences. Thus, the account offers both an attainable standard of moral judgment and a standard that can transcend the biases of the society which gave rise to it. I also defend the account against three challenges: (a) ideal observer theories do not offer the right kind of motivation to act on the verdicts of the ideal observer; (b) ideal observer theories cannot explain why the idealization in question is well-motivated and not objectionably ad hoc; (c) the standard used in ideal observer theories cannot be defended upon further reflection, because we would need a non-arbitrary, second-order standard to govern our reflection on the first-order standard of moral judgment. (shrink)

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By (...) bringing considerations of perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates the (...) semantics of the associated logic, and such systems typically violate the subformula property to a high degree. By contrast, nested sequent calculi employ a simpler syntax and adhere to a strict reading of the subformula property, making such systems useful in the design of automated reasoning algorithms. However, the downside of the nested sequent paradigm is that a general theory concerning the automated construction of such calculi (as in the labelled setting) is essentially absent, meaning that the construction of nested systems and the confirmation of their properties is usually done on a case-by-case basis. The refinement method connects both paradigms in a fruitful way, by transforming labelled systems into nested (or, refined labelled) systems with the properties of the former preserved throughout the transformation process. To demonstrate the method of refinement and some of its applications, we consider grammar logics, first-order intuitionistic logics, and deontic STIT logics. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics. Furthermore, we employ our refined labelled calculi for grammar logics to show that every logic in the class possesses the effective Lyndon interpolation property. (shrink)

Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic (...) Analysis of Variable Binding Term Operators” (Co-author John Herring), Logique et Analyse 55, 646–57. MR0307874 (46 #6989). A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. Kalish-Montague 1964 proposed using vbtos to formalize definite descriptions “the x: x+x=2”, set abstracts {x: F}, minimization in recursive function theory “the least x: x+x>2”, etc. However, they gave no semantics for vbtos. Hatcher 1968 gave a semantics but one that has flaws described in the 1971 paper and admitted by Hatcher. In 1971 we give a correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture, proved in this paper with Hatcher’s help, was proved independently about the same time by Newton da Costa. (shrink)

Feminist, and other liberatory, moral and political philosophies are widely understood as nonideal theories. But if feminism is just a set of first-order normative commitments, it is unclear why it should produce action-guiding philosophy. I argue that feminist philosophy characteristically takes oppressive salience idealization (OSI) to undermine the means-end consistency of normative theories. OSI involves characterizing the world in ways that give undue weight to the interests and perspectives of the dominant. Our ability to respond to the normative (...) problems our actual world faces us with is undermined by OSI, especially at the levels of problem-framing and selection. (shrink)

Introduction to mathematical logic. Part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.

We present a theory of cooperative-competitive intelligence (CCI), its measures, research program, and applications that stem from it. Within the framework of this theory, satisficing sub-optimal behavior is any behavior that does not promote a decrease in the prospective control of the functional action diversity/unpredictability (D/U) potential of the agent or team. This potential is defined as the entropy measure in multiple, context-dependent dimensions. We define the satisficing interval of behaviors as CCI. In order to manifest itself (...) at individual or team level, this capacity harnesses properties such as degeneracy, pleiotropy (pluri-potentiality), synergies, and metastability. Intelligence is embodied because intelligent behavior is deeply dependent on body functionalities, defined as entropy measures. We base our theory on three principles: (a) relativity of functional entropy/ information in agent (team)-environment systems, (b) tendency toward the satisficing level of D/U potential, and (c) tendency toward the non-decreasing D/U potential. The conjunction of these three principles provides existence of sub-optimal behaviors associated with CCI. First, we deal with the problem of how to reduce multidimensional behavior to a concept that accounts for the vast set of scenarios in which CCI is manifested. Secondly, we define and discuss the three interacting principles that underpin CCI behavior as well as providing an outline for a future CCI research program supported by agent￾based modeling and empirical research. Finally, we provide some preliminary practical issues that stem from the theory. (shrink)

Foundational relations play an important role in the ontological foundations of conceptual modeling. Their investigation has been theoretically addressed in philosophical/ontological theories, and empirically offered in foundational ontologies (FOs). FOs are comprehensive theories that model the world as top-level entities and relations. Empirically, for modelers aiming to use foundational relations without an urge for entity types, FOs seem to be complex to comprehend, comply with, and integrate in practice. And since the practice of these relations is critical for conceptual modeling (...) tasks, we present an approach that builds a well-founded entity-type free relations theory within a first-order-logic formalization, besides large complex FOs. The theory contributes to a minimal set of foundational ontological relations (FORT) by importing extant theories (mereotopology and location) and (re-)formalizing other relations (dependence, membership, constitution, and entity-location), while no FO has compromised this set. (shrink)

There is a trade-off between specificity and accuracy in existing models of belief. Descriptions of agents in the tripartite model, which recognizes only three doxastic attitudes—belief, disbelief, and suspension of judgment—are typically accurate, but not sufficiently specific. The orthodox Bayesian model, which requires real-valued credences, is perfectly specific, but often inaccurate: we often lack precise credences. I argue, first, that a popular attempt to fix the Bayesian model by using sets of functions is also inaccurate, since it requires us (...) to have interval-valued credences with perfectly precise endpoints. We can see this problem as analogous to the problem of higher order vagueness. Ultimately, I argue, the only way to avoid these problems is to endorse Insurmountable Unclassifiability. This principle has some surprising and radical consequences. For example, it entails that the trade-off between accuracy and specificity is in-principle unavoidable: sometimes it is simply impossible to characterize an agent’s doxastic state in a way that is both fully accurate and maximally specific. What we can do, however, is improve on both the tripartite and existing Bayesian models. I construct a new model of belief—the minimal model—that allows us to characterize agents with much greater specificity than the tripartite model, and yet which remains, unlike existing Bayesian models, perfectly accurate. (shrink)

This paper is part of a project that is based on the notion of a dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In Amidei et al. (2016, Rev. Symb. Logic, 9, 1–26) and Amidei et al. (2016, Rev. Symb. Logic, 9, 299–324), we investigated the expressive and computational power of dialectical systems, and we compared them to a new class of systems, that of quasi-dialectical systems, that enrich Magari’s systems with a natural mechanism (...) of revision. In the present paper we consider a third class of systems, that of p-dialectical systems, that naturally combine features coming from the two other cases. We prove several results about p-dialectical systems and the sets that they represent. Then we focus on the completions of first-order theories. In doing so, we consider systems with connectives, i.e. systems that encode the rules of classical logic. We show that any consistent system with connectives represents the completion of a given theory. We prove that dialectical and q-dialectical systems coincide with respect to the completions that they can represent. Yet, p-dialectical systems are more powerful; we exhibit a p-dialectical system representing a completion of Peano Arithmetic that is neither dialectical nor q-dialectical. (shrink)

We aim to compile some means for a rational reconstruction of a named part of the start-over of Baruch (Benedictus) de Spinoza's metaphysics in 'de deo' (which is 'pars prima' of the 'ethica, ordine geometrico demonstrata' ) in terms of 1st order model theory. In so far, as our approach will be judged successful, it may, besides providing some help in understanding Spinoza, also contribute to the discussion of some or other philosophical evergreen, e.g. 'ontological commitment'. For this (...) text we assume the reader familiar with 'de deo' as well as with some basic concepts and results of 1st order model theory. Before we start reconstruction, we will first revisit shortly the concept of 'attributum' (definitio IV) in it's setting in 'de deo' , next scan for formalizable aspects of 'in suo genere finita' ('de deo', definitio II), subsequently list the model theoretic constructs we will make use of. Then we begin reconstruction by stating "coordinative definitions" for the notions of 'attribute (of a substance)', 'modus (as conceived via an attribute)' and 'substance (as conceived via an attribute)', reasoning shortly for each of them. The "coordinative definitions", we will arrive at, must not be understood as literal translations of Spinoza's concepts - of course, there can't be such a thing as a literal translation - they are meant as formal analoga of these concepts, mapping some logical structure. But even with this caveat they may seem strange to the reader at this stage of discussion. Additional justification for them then should be found in our endeavour, to map some argumentation of Spinoza's proofs of some of his propositions from this starting point. -/- [ Version 1 of this paper originated from 2020-03-14. This is version 2 from 2021-09-12 with some readability amendments. ]. (shrink)

Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Gödel logics by Avron. It is shown that the system is sound and (...) complete, and allows cut-elimination. A question by Takano regarding the eliminability of the Takeuti-Titani density rule is answered affirmatively. (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case (...) of QmbC, the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

The dispute between realists about color and anti-realists is actually a dispute about the nature of color properties. The disputants do not disagree over what material objects are like. Rather, they disagree over whether any of the uncontroversial facts about material objects--their powers to cause visual experiences, their dispositions to reflect incident light, their atomic makeup, and so on--amount to their having colors. The disagreement is thus about which properties colors are and, in particular, whether colors are any of the (...) properties in a particular set that is acknowledged on both sides to exhaust the properties of material objects. In a previous paper we discussed at length one attempt to identify colors with particular properties of material objects--namely, with their dispositions to cause visual experiences. Here we shall discuss a different and perhaps more influential version of realism, which says that the colors of material objects are microphysical properties of their surfaces. We shall call this theory physicalism about color (physicalism, for short). In order to evaluate this theory, however, we shall first have to clarify some methodological issues. Our hope is that we can bring some further clarity to the question of color realism, whether or not we succeed in our critique of the physicalists' answer. (shrink)

This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the set of (...) numbers satisfying “not odd but not not-prime”. The mistake is thinking that every two logically-equivalent false universal propositions have the same counterexamples. Only false universal propositions have counterexamples. A counterexample for “every two logically-equivalent false universal propositions have the same counterexamples” is two logically-equivalent false universal propositions not having the same counterexamples. The following counterexample arose naturally in my sophomore deductive logic course in a discussion of inner and outer converses. “Every even number precedes every odd number” is counterexemplified only by even numbers, whereas its equivalent “Every odd number is preceded by every even number” is counterexemplified only by odd numbers. Please let me know if you see this mistake in print. Also let me know if you have seen these points discussed before. I learned them in my own course: talk about learning by teaching! (shrink)

-/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a (...) correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. -/- The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, (...) undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

The hard problem of consciousness arises in most incarnations of present day physicalism. Why should certain physical processes necessarily be accompanied by experience? One possible response is that physicalism itself should be modified in order to accommodate experience: But, modified how? In the present work, we investigate whether an ontology derived from quantum field theory can help resolve the hard problem. We begin with the assumption that experience cannot exist without being accompanied by a subject of experience (SoE). (...) While people well versed in Indian philosophy will not find that statement problematic, it is still controversial in the analytic tradition. Luckily for us, Strawson has elaborately defended the notion of a thin subject—an SoE which exhibits a phenomenal unity with different types of content (sensations, thoughts etc.) occurring during its temporal existence. Next, following Stoljar, we invoke our ignorance of the true physical as the reason for the explanatory gap between present day physical processes (events, properties) and experience. We are therefore permitted to conceive of thin subjects as related to the physical via a new, yet to be elaborated relation. While this is difficult to conceive under most varieties of classical physics, we argue that this may not be the case under certain quantum field theory ontologies. We suggest that the relation binding an SoE to the physical is akin to the relation between a particle and (quantum) field. In quantum field theory, a particle is conceived as a coherent excitation of a field. Under the right set of circumstances, a particle coalesces out of a field and dissipates. We suggest that an SoE can be conceived as akin to a particle—a SelfOn—which coalesces out of physical fields, persists for a brief period of time and then dissipates in a manner similar to the phenomenology of a thin subject. Experiences are physical properties of selfons with the constraint (specified by a similarity metric) that selfons belonging to the same natural kind will have similar experiences. While it is odd at first glance to conceive of subjects of experience as akin to particles, the spatial and temporal unity exhibited by particles as opposed to fields and the expectation that selfons are new kinds of particles, paves the way for cementing this notion. Next, we detail the various no-go theorems in most versions of quantum field theory and discuss their impact on the existence of selfons. Finally, we argue that the time is ripe for a rejuvenated Indian philosophy to begin tackling the three-way relationship between SoEs (which may become equivalent to jivas in certain Indian frameworks), phenomenal content and the physical world. With analytic philosophy still struggling to come to terms with the complex worlds of quantum field theory and with the relative inexperience of the western world in arguing the jiva-world relation, there is a clear and present opportunity for Indian philosophy to make a worldcentric contribution to the hard problem of experience. (shrink)

Consider a variant of the usual story about the iterative conception of sets. As usual, at every stage, you find all the (bland) sets of objects which you found earlier. But you also find the result of tapping any earlier-found object with any magic wand (from a given stock of magic wands). -/- By varying the number and behaviour of the wands, we can flesh out this idea in many different ways. This paper's main Theorem is that any loosely constructive (...) way of fleshing out this idea is synonymous with a ZF-like theory. -/- This Theorem has rich applications; it realizes John Conway's (1976) Mathematicians' Liberation Movement; and it connects with a lovely idea due to Alonzo Church (1974). (shrink)

In Mathematics is megethology. Philosophia Mathematica, 1, 3–23) David K. Lewis proposes a structuralist reconstruction of classical set theory based on mereology. In order to formulate suitable hypotheses about the size of the universe of individuals without the help of set-theoretical notions, he uses the device of Boolos’ plural quantification for treating second order logic without commitment to set-theoretical entities. In this paper we show how, assuming the existence of a pairing function on atoms, as the unique (...) assumption non expressed in a mereological language, a mereological foundation of set theory is achievable within first order logic. Furthermore, we show how a mereological codification of ordered pairs is achievable with a very restricted use of the notion of plurality without plural quantification. (shrink)

Honors Research: PPE @ UPenn | This thesis seeks to address some of the most central questions to the fields of political philosophy and political economy. How can social order and government develop from anarchy under standard economic assumptions of rationality, where all agents act strictly in their own interests? What are the deontological limits to the State’s use of force such that political legitimacy is maintained, and how do these ethical boundaries of government relate to moral obligations conferred (...) upon individuals? Finally, what sets of policies and social institutions ought the State implement to achieve the best welfare outcomes for a society, and is there a necessary conflict between policy consequentialism and deontological ethics? This thesis will first show that a laissez-faire capitalist social order spontaneously emerges from the State of Nature as a result of mutual self-interest between rational agents, with the institution of government being a mere product of market forces that is best modeled as a locally-monopolized, excludable, collective entity with global competition. Then, this thesis will defend a theory of natural rights on the basis that persons are normatively separate, before establishing that laissez-faire capitalism and its contractual form of government are uniquely in compliance with these universal moral standards of conduct that predate the institution of any state. Finally, it will be argued in this thesis that the key tenets of laissez-faire capitalism - strong individual rights to life, liberty, and property - produce maximal human welfare from both individualist and collectivist aggregations, before such conclusions are translated into a foundation for limited government. These arguments serve to solidify libertarianism as both the dominant political philosophy and the globally convergent equilibrium of political organization, while also demonstrating that laissez-faire capitalism is the optimal form of social order. (shrink)

Conventional wisdom dictates that proofs of mathematical propositions should be treated as necessary, and sufficient, for entailing `significant' mathematical truths only if the proofs are expressed in a---minimally, deemed consistent---formal mathematical theory in terms of: * Axioms/Axiom schemas * Rules of Deduction * Definitions * Lemmas * Theorems * Corollaries. Whilst Andrew Wiles' proof of Fermat's Last Theorem FLT, which appeals essentially to geometrical properties of real and complex numbers, can be treated as meeting this criteria, it nevertheless leaves (...) two questions unanswered: (i) Why is x^n +y^n = z^n solvable only for n < 3 if x, y, z, n are natural numbers? (ii) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? Prevailing post-Wiles wisdom---leaving (i) essentially unaddressed---dismisses Fermat's claim as a conjecture without a plausible proof of FLT. -/- However, we posit that providing evidence-based answers to both queries is necessary not only for treating FLT as significant, but also for understanding why FLT can be treated as a true arithmetical proposition. We thus argue that proving a theorem formally from explicit, and implicit, premises/axioms using rules of deduction---as currently accepted---is a meaningless game, of little scientific value, in the absence of evidence that has already established---unambiguously---why the premises/axioms and rules of deduction can be treated, and categorically communicated, as pre-formal truths in Marcus Pantsar's sense. Consequently, only evidence-based, pre-formal, truth can entail formal provability; and the formal proof of any significant mathematical theorem cannot entail its pre-formal truth as evidence-based. It can only identify the explicit/implicit premises that have been used to evidence the, already established, pre-formal truth of a mathematical proposition. Hence visualising and understanding the evidence-based, pre-formal, truth of a mathematical proposition is the only raison d'etre for subsequently seeking a formal proof of the proposition within a formal mathematical language (whether first-order or second order set theory, arithmetic, geometry, etc.) By this yardstick Andrew Wiles' proof of FLT fails to meet the required, evidence-based, criteria for entailing a true arithmetical proposition. -/- Moreover, we offer two scenarios as to why/how Fermat could have laconically concluded in his recorded marginal noting that FLT is a true arithmetical proposition---even though he either did not (or could not to his own satisfaction) succeed in cogently evidencing, and recording, why FLT can be treated as an evidence-based, pre-formal, arithmetical truth (presumably without appeal to properties of real and complex numbers). It is primarily such a putative, unrecorded, evidence-based reasoning underlying Fermat's laconic assertion which this investigation seeks to reconstruct; and to justify by appeal to a plausible resolution of some philosophical ambiguities concerning the relation between evidence-based, pre-formal, truth and formal provability. (shrink)

How much surveillance is morally permissible in the pursuit of a socially desirable goal? The proportionality question has received renewed attention during the 2020 Coronavirus pandemic, because governments in many countries have responded to the pandemic by implementing, redirecting or expanding state surveillance, most controversially in the shape of collection and use of cell-phone location data to support a strategy of contact tracing, testing and containment. Behind the proportionality question lies a further question: in what way does a state of (...) emergency affect the proportionality of morally permissible surveillance? On the qualitative difference view, a state of emergency has the effect of suspending or altering at least some of the constraints on morally permissible action that apply under ordinary circumstances. On the quantitative difference view, the only difference between states of emergency and ordinary circumstances is that the stakes are greater in a state of emergency. If the qualitative difference view is true, then there are situations, perhaps such as the current Coronavirus pandemic, during which the proportionality condition employs a much less demanding ratio between social goods achieved and the badness of the surveillance performed. The overall objective of this article is to argue against the qualitative and for the quantitative difference view. I proceed by first setting out in somewhat greater detail how we must understand the qualitative difference view (section two). I then present a series of problematic implications of adopting the qualitative difference view and argue that jointly these give us sufficient reason to reject it (section three). This entails that our account of morally permissible surveillance should be unexceptional, i.e. the quantitative difference view: there is no morally significant difference between proportionality in ordinary circumstances and proportionality in emergencies, simply a spectrum of smaller to greater potential goods and bads of surveillance. In order to flesh out the implications of the quantitative view, I briefly sketch an unexceptional theory of proportional surveillance in exceptional circumstances (section four). The last section (five) summarises and concludes. (shrink)