I exploit parallel considerations in the philosophy of mind and metaethics to argue that the reasoning employed in an important argument for panpsychism overgeneralizes to support an analogous position in metaethics: panmoralism. Next, I raise a number of problems for panmoralism and thereby build a case for taking the metaethical parallel to be a reductio ad absurdum of the argument for panpsychism. Finally, I contrast panmoralism with a position recently defended by Einar Duenger Bohn and argue that the two suffer (...) from similar problems. I conclude by drawing some general lessons for panpsychism. (shrink)

I exploit parallel considerations in the philosophy of mind and metaethics to argue that the reasoning employed in an important argument for panpsychism overgeneralizes to support an analogous position in metaethics: panmoralism. Next, I raise a number of problems for panmoralism and thereby build a case for taking the metaethical parallel to be a reductio ad absurdum of the argument for panpsychism. Finally, I contrast panmoralism with a position recently defended by Einar Duenger Bohn and argue that the two suffer (...) from similar problems. I conclude by drawing some general lessons for panpsychism. (shrink)

Logical paradoxes – like the Liar, Russell's, and the Sorites – are notorious. But in Paradoxes and Inconsistent Mathematics, it is argued that they are only the noisiest of many. Contradictions arise in the everyday, from the smallest points to the widest boundaries. In this book, Zach Weber uses “dialetheic paraconsistency” – a formal framework where some contradictions can be true without absurdity – as the basis for developing this idea rigorously, from mathematical foundations up. In doing so, Weber (...) directly addresses a longstanding open question: how much standard mathematics can paraconsistency capture? The guiding focus is on a more basic question, of why there are paradoxes. Details underscore a simple philosophical claim: that paradoxes are found in the ordinary, and that is what makes them so extraordinary. (shrink)

Ng :255–285, 1995. https://doi.org/10.1007/bf00852469) models the evolutionary dynamics underlying the existence of suffering and enjoyment and concludes that there is likely to be more suffering than enjoyment in nature. In this paper, we find an error in Ng’s model that, when fixed, negates the original conclusion. Instead, the model offers only ambiguity as to whether suffering or enjoyment predominates in nature. We illustrate the dynamics around suffering and enjoyment with the most plausible parameters. In our illustration, we find surprising results: (...) the rate of failure to reproduce can improve or worsen average welfare depending on other characteristics of a species. Our illustration suggests that for organisms with more intense conscious experiences, the balance of enjoyment and suffering may lean more toward suffering. We offer some suggestions for empirical study of wild animal welfare. We conclude by noting that recent writings on wild animal welfare should be revised based on this correction to have a somewhat less pessimistic view of nature. (shrink)

In this book, Zach Kelehear offers readers a new perspective on an important, dynamic, and sometimes daunting issue: managing successful school-based leadership. The author uses an arts-based approach to weave together notions of research-based leadership skills for successful school-based management with standards of professional competence as represented by the Interstate School Leaders Licensure Consortium Standards for School Leaders.

Prevailing opinion—defended by Jason Brennan and others—is that voting to change the outcome is irrational, since although the payoffs of tipping an election can be quite large, the probability of doing so is extraordinarily small. This paper argues that prevailing opinion is incorrect. Voting is shown to be rational so long as two conditions are satisfied: First, the average social benefit of electing the better candidate must be at least twice as great as the individual cost of voting, and second, (...) the chance of casting the decisive vote must be at least 1/N, where N stands for the number of citizens. It is argued that both of these conditions are often true in the real world. (shrink)

There is a well-known moral quandary concerning how to account for the rightness or wrongness of acts that clearly contribute to some morally significant outcome – but which each seem too small, individually, to make any meaningful difference. One consequentialist-friendly response to this problem is to deny that there could ever be a case of this type. This paper pursues this general strategy, but in an unusual way. Existing arguments for the consequentialist-friendly position are sorites-style arguments. Such arguments imagine varying (...) a subject’s predicament bit by bit until it is clear that a relevant difference has been achieved. The arguments offered in this paper are structurally different, and do not rely on any sorites series. For this reason, they are not vulnerable to objections that have been leveled against the sorites-style arguments. (shrink)

This thesis divides naturally into two parts, each concerned with the extent to which the theory of $L$ can be changed by forcing.The first part focuses primarily on applying generic-absoluteness principles to how that definable sets of reals enjoy regularity properties. The work in Part I is joint with Itay Neeman and is adapted from our paper Happy and mad families in $L$, JSL, 2018. The project was motivated by questions about mad families, maximal families of infinite subsets of $\omega (...) $ of which any two have only finitely many members in common. We begin, in the spirit of Mathias, by establishing a strong Ramsey property for sets of reals in the Solovay model, giving a new proof of Törnquist’s theorem that there are no infinite mad families in the Solovay model.In Chapter 3 we stray from the main line of inquiry to briefly study a game-theoretic characterization of filters with the Baire Property.Neeman and Zapletal showed, assuming roughly the existence of a proper class of Woodin cardinals, that the boldface theory of $L$ cannot be changed by proper forcing. They call their result the Embedding Theorem, because they conclude that in fact there is an elementary embedding from the $L$ of the ground model to that of the proper forcing extension. With a view toward analyzing mad families under $\mathsf {AD}^+$ and in $L$ under large-cardinal hypotheses, in Chapter 4 we establish triangular versions of the Embedding Theorem. These are enough for us to use Mathias’s methods to show that there are no infinite mad families in $L$ under large cardinals and that $\mathsf {AD}^+$ implies that there are no infinite mad families. These are again corollaries of theorems about strong Ramsey properties under large-cardinal assumptions and $\mathsf {AD}^+$, respectively. Our first theorem improves the large-cardinal assumption under which Todorcevic established the nonexistence of infinite mad families in $L$. Part I concludes with Chapter 5, a short list of open questions.In the second part of the thesis, we undertake a finer analysis of the Embedding Theorem and its consistency strength. Schindler found that the the Embedding Theorem is consistent relative to much weaker assumptions than the existence of Woodin cardinals. He defined remarkable cardinals, which can exist even in L, and showed that the Embedding Theorem is equiconsistent with the existence of a remarkable cardinal. His theorem resembles a theorem of Harrington–Shelah and Kunen from the 1980s: the absoluteness of the theory of $L$ to ccc forcing extensions is equiconsistent with a weakly compact cardinal. Joint with Itay Neeman, we improve Schindler’s theorem by showing that absoluteness for $\sigma $ -closed $\ast $ ccc posets—instead of the larger class of proper posets—implies the remarkability of $\aleph _1^V$ in L. This requires a fundamental change in the proof, since Schindler’s lower-bound argument uses Jensen’s reshaping forcing, which, though proper, need not be $\sigma $ -closed $\ast $ ccc in that context. Our proof bears more resemblance to that of Harrington–Shelah than to Schindler’s.The proof of Theorem 6.2 splits naturally into two arguments. In Chapter 7 we extend the Harrington–Shelah method of coding reals into a specializing function to allow for trees with uncountable levels that may not belong to L. This culminates in Theorem 7.4, which asserts that if there are $X\subseteq \omega _1$ and a tree $T\subseteq \omega _1$ of height $\omega _1$ such that X is codable along T, then $L$ -absoluteness for ccc posets must fail.We complete the argument in Chapter 8, where we show that if in any $\sigma $ -closed extension of V there is no $X\subseteq \omega _1$ codable along a tree T, then $\aleph _1^V$ must be remarkable in L.In Chapter 9 we review Schindler’s proof of generic absoluteness from a remarkable cardinal to show that the argument gives a level-by-level upper bound: a strongly $\lambda ^+$ -remarkable cardinal is enough to get $L$ -absoluteness for $\lambda $ -linked proper posets.Chapter 10 is devoted to partially reversing the level-by-level upper bound of Chapter 9. Adapting the methods of Neeman, Hierarchies of forcing axioms II, we are able to show that $L$ -absoluteness for $\left |\mathbf {R}\right |\cdot \left |\lambda \right |$ -linked posets implies that the interval $[\aleph _1^V,\lambda ]$ is $\Sigma ^2_1$ -remarkable in L.prepared by Zach Norwood.E-mail: [email protected]. (shrink)

This paper is about how to aggregate outside opinion. If two experts are on one side of an issue, while three experts are on the other side, what should a non-expert believe? Certainly, the non-expert should take into account more than just the numbers. But which other factors are relevant, and why? According to the view developed here, one important factor is whether the experts should have been expected, in advance, to reach the same conclusion. When the agreement of two (...) (or of twenty) thinkers can be predicted with certainty in advance, their shared belief is worth only as much as one of their beliefs would be worth alone. This expectational model of belief dependence can be applied whether we think in terms of credences or in terms of all-or-nothing beliefs. (shrink)

Philosophy and Phenomenological Research, EarlyView.

Should we believe our controversial philosophical views? Recently, several authors have argued from broadly conciliationist premises that we should not. If they are right, we philosophers face a dilemma: If we believe our views, we are irrational. If we do not, we are not sincere in holding them. This paper offers a way out, proposing an attitude we can rationally take toward our views that can support sincerity of the appropriate sort. We should arrive at our views via a certain (...) sort of ‘insulated’ reasoning – that is, reasoning that involves setting aside certain higher-order worries, such as those provided by disagreement – when we investigate philosophical questions. (shrink)

This essay examines the anti-producing human body in its limit case of public self-induced starvation, as figured in Franz Kafka's short story ‘A Hunger Artist’ and Steve McQueen's film Hunger. Both works represent the fasting body as hollowed out, a resistance to capitalist-spectator capture that spatialises itself as a smoothing, a relative reconfiguration of parts to whole through the evacuation of flows. In both works the human body becomes a local body without organs, paradoxically disarticulated from the more complex assemblages (...) that constitute it while recording potential circuits of disturbance or resonance predicated upon the porousness of bodily boundaries. (shrink)

In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert's first epsilon theorem and a certain "general consistency result" due to Bernays. An analysis of the form of this so-called "failed proof" (...) sheds further light on an interpretation of Hilbert's programme as an instrumentalist enterprise with the aim of showing that whenever a "real" proposition can be proved by ?ideal? means, it can also be proved by "real", finitary means. (shrink)

The Church-Turing Thesis is widely regarded as true, because of evidence that there is only one genuine notion of computation. By contrast, there are nowadays many different formal logics, and different corresponding foundational frameworks. Which ones can deliver a theory of computability? This question sets up a difficult challenge: the meanings of basic mathematical terms are not stable across frameworks. While it is easy to compare what different frameworks say, it is not so easy to compare what they mean. We (...) argue for some minimal conditions that must be met if two frameworks are to be compared; if frameworks are radical enough, comparison becomes hopeless. Our aim is to clarify the dialectical situation in this bourgeoning area of research, shedding light on the nature of non-classical logic and the notion of computation alike. (shrink)

The Curry-Howard isomorphism is a proof-theoretic result that establishes a connection between derivations in natural deduction and terms in typed lambda calculus. It is an important proof-theoretic result, but also underlies the development of type systems for programming languages. This fact suggests a potential importance of the result for a philosophy of code.

Although arguments for and against competing theories of vagueness often appeal to claims about the use of vague predicates by ordinary speakers, such claims are rarely tested. An exception is Bonini et al. (1999), who report empirical results on the use of vague predicates by Italian speakers, and take the results to count in favor of epistemicism. Yet several methodological difficulties mar their experiments; we outline these problems and devise revised experiments that do not show the same results. We then (...) describe three additional empirical studies that investigate further claims in the literature on vagueness: the hypothesis that speakers confuse ‘P’ with ‘definitely P’, the relative persuasiveness of different formulations of the inductive premise of the Sorites, and the interaction of vague predicates with three different forms of negation. (shrink)

Conciliationism faces a challenge that has not been satisfactorily addressed. There are clear cases of epistemically significant merely possible disagreement, but there are also clear cases where merely possible disagreement is epistemically irrelevant. Conciliationists have not yet accounted for this asymmetry. In this paper, we propose that the asymmetry can be explained by positing a selection constraint on all cases of peer disagreement—whether actual or merely possible. If a peer’s opinion was not selected in accordance with the proposed constraint, then (...) it lacks epistemic significance. This allows us to distinguish the epistemically significant cases of merely possible disagreement from the insignificant ones. (shrink)

In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) of classical mathematics. Although Hilbert proposed his program in this form only in 1921, various facets of it are rooted in foundational work of his going back until around 1900, when he first pointed out the necessity of giving a direct consistency proof of analysis. Work on the program progressed significantly in the 1920s with contributions from logicians such as Paul Bernays, Wilhelm Ackermann, John von Neumann, and Jacques Herbrand. It was also a great influence on Kurt Gödel, whose work on the incompleteness theorems were motivated by Hilbert's Program. Gödel's work is generally taken to show that Hilbert's Program cannot be carried out. It has nevertheless continued to be an influential position in the philosophy of mathematics, and, starting with the work of Gerhard Gentzen in the 1930s, work on so-called Relativized Hilbert Programs have been central to the development of proof theory. (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued first order (...) logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...) successes, and generated important advances in logical theory and metatheory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s. (shrink)

Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these results, focussing (...) primarily on propositional logic, and to put them in their historical context. It is argued that truth-value semantics, syntactic ("Post-") and semantic completeness, decidability, and other results were first obtained by Hilbert and Bernays in 1918, and that Bernays's role in their discovery and the subsequent development of mathematical logic is much greater than has so far been acknowledged. (shrink)

On some accounts of vagueness, predicates like “is a heap” are tolerant. That is, their correct application tolerates sufficiently small changes in the objects to which they are applied. Of course, such views face the sorites paradox, and various solutions have been proposed. One proposed solution involves banning repeated appeals to tolerance, while affirming tolerance in any individual case. In effect, this solution rejects the reasoning of the sorites argument. This paper discusses a thorny problem afflicting this approach to vagueness. (...) In particular, it is shown that, on the foregoing view, whether an object is a heap will sometimes depend on factors extrinsic to that object, such as whether its components came from other heaps. More generally, the paper raises the issue of how to count heaps in a tolerance-friendly framework. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Critical study of Michael Potter, Reason's Nearest Kin. Philosophies of Arithmetic from Kant to Carnap. Oxford University Press, Oxford, 2000. x + 305 pages.

The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible presentations of its theory on the other. One significant early result for the original axiomatic proof system for the epsilon-calculus is the first epsilon theorem, for which a proof is sketched. The system itself is discussed, also relative to possible semantic interpretations. The problems facing (...) the development of proof-theoretically well-behaved systems are outlined. (shrink)

David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...) little attention, and on a number of philosophical reconstructions of the viewpoint (in particular, by Hand, Kitcher, and Tait). (shrink)

After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and Bernays) in a series of lecture courses atthe (...) University of Göttingen between 1917 and 1923, and notably in Ackermann's dissertation of 1924. The main innovation was theinvention of the -calculus, on which Hilbert's axiom systemswere based, and the development of the -substitution methodas a basis for consistency proofs. The paper traces the developmentof the ``simultaneous development of logic and mathematics'' throughthe -notation and provides an analysis of Ackermann'sconsistency proofs for primitive recursive arithmetic and for thefirst comprehensive mathematical system, the latter using thesubstitution method. It is striking that these proofs use transfiniteinduction not dissimilar to that used in Gentzen's later consistencyproof as well as non-primitive recursive definitions, and that thesemethods were accepted as finitistic at the time. (shrink)

An Introduction to Proof Theory provides an accessible introduction to the theory of proofs, with details of proofs worked out and examples and exercises to aid the reader's understanding. It also serves as a companion to reading the original pathbreaking articles by Gerhard Gentzen. The first half covers topics in structural proof theory, including the Gödel-Gentzen translation of classical into intuitionistic logic, natural deduction and the normalization theorems, the sequent calculus, including cut-elimination and mid-sequent theorems, and various applications of these (...) results. The second half examines ordinal proof theory, specifically Gentzen's consistency proof for first-order Peano Arithmetic. The theory of ordinal notations and other elements of ordinal theory are developed from scratch, and no knowledge of set theory is presumed. The proof methods needed to establish proof-theoretic results, especially proof by induction, are introduced in stages throughout the text. Mancosu, Galvan, and Zach's introduction will provide a solid foundation for those looking to understand this central area of mathematical logic and the philosophy of mathematics. (shrink)

This paper begins an axiomatic development of naive set theoryin a paraconsistent logic. Results divide into two sorts. There is classical recapture, where the main theorems of ordinal and Peano arithmetic are proved, showing that naive set theory can provide a foundation for standard mathematics. Then there are major extensions, including proofs of the famous paradoxes and the axiom of choice (in the form of the well-ordering principle). At the end I indicate how later developments of cardinal numbers will lead (...) to Cantor’s theorem, the existence of large cardinals, and a counterexample to the continuum hypothesis. (shrink)

In The Boundary Stones of Thought, Rumfitt defends classical logic against challenges from intuitionistic mathematics and vagueness, using a semantics of pre-topologies on possibilities, and a topological semantics on predicates, respectively. These semantics are suggestive but the characterizations of negation face difficulties that may undermine their usefulness in Rumfitt’s project.

This note motivates a logic for a theory that can express its own notion of logical consequence—a ‘syntactically closed’ theory of naive validity. The main issue for such a logic is Curry’s paradox, which is averted by the failure of contraction. The logic features two related, but different, implication connectives. A Hilbert system is proposed that is complete and non-trivial.

The use of the symbol ∨for disjunction in formal logic is ubiquitous. Where did it come from? The paper details the evolution of the symbol ∨ in its historical and logical context. Some sources say that disjunction in its use as connecting propositions or formulas was introduced by Peano; others suggest that it originated as an abbreviation of the Latin word for “or,” vel. We show that the origin of the symbol ∨ for disjunction can be traced to Whitehead and (...) Russell’s pre-Principia work in formal logic. Because of Principia’s influence, its notation was widely adopted by philosophers working in logic (the logical empiricists in the 1920s and 1930s, especially Carnap and early Quine). Hilbert’s adoption of ∨ in his Grundzüge der theoretischen Logik guaranteed its widespread use by mathematical logicians. The origins of other logical symbols are also discussed. (shrink)

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. Rather than (...) any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

A central goal of the scientific endeavor is to explain phenomena. Scientists often attempt to explain a phenomenon by way of representing it in some manner—such as with mathematical equations, models, or theory—which allows for an explanation of the phenomenon under investigation. However, in developing scientific representations, scientists typically deploy simplifications and idealizations. As a result, scientific representations provide only partial, and often distorted, accounts of the phenomenon in question. Philosophers of science have analyzed the nature and function of how (...) scientists construct representations, deploy idealizations, and provide explanations. As such, our aim in this special issue is to bring these three pillars of research into closer contact with the contributions to it focusing on three main themes. -/- The first set of papers, Alan Baker (2021) and Marc Lange (2021), address mathematical explanations in science. Baker (2021), a proponent of mathematical Platonism, examines its capacity to evade the critique that the so-called Enhanced Indispensability Argument is circular. Lange (2021) examines distinctively mathematical explanations, arguing that neither Platonism nor representationalism are successful paths, and instead argues in favor of Aristotelian realism. A second theme emerging from the papers in this special issue is the impact that various conceptualizations of idealization have on our abilities to offer scientific explanations, to pro- duce an analysis of what explanations are or should be, and to understand scientific representation. Peter Tan (2021) suggests amending inferentialist accounts of scientific representation to account for inconsistent idealizations. Michael Strevens (2021) advocates a view wherein the introduction of idealizations into a model is legitimate so long as it pertains to non-difference-making factors, arguing for a logical reading of the notion of difference-making. Natalia Carrillo and Tarja Knuuttila (2022) offer an alternative account to the idealization-as-distortion view, emphasizing instead the holistic nature of idealization. -/- Finally, contributions by Carrillo and Knuuttila (2022), Terzian (2021), Valente (2021), and Rodriguez (2021) illustrate how issues regarding idealization, representation, and explanation are applied to specific contexts and across various sciences. Carrillo and Knuuttila (2022) examine conceptions of idealization in the context of models of the nerve impulse. Giulia Terzian (2021) extends the discussion of idealizations to the context of generative linguistics. Giovanni Valente (2021) examines how idealizations and evaluations of accurate representation impact capacities to explain phenomena in the context of statistical thermodynamics. Quentin Rodriguez (2021) examines the role of idealizations and analogies in various strategies to explain critical phenomena. -/- In what follows, we offer a brief overview of important philosophical issues connected to representation, idealization, and explanation in science. We then provide short summaries of the eight papers in this special issue. (shrink)

First-order Gödel logics are a family of finite- or infinite-valued logics where the sets of truth values V are closed subsets of [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics GV (sets of those formulas which evaluate to 1 in every interpretation into V). It is shown that GV is axiomatizable iff V is finite, V is uncountable with 0 isolated in V, or every neighborhood of 0 in V is uncountable. Complete (...) axiomatizations for each of these cases are given. The r.e. prenex, negation-free, and existential fragments of all first-order Gödel logics are also characterized. (shrink)

This article suggests a novel way to advance a current debate in the philosophy of mathematics. The debate concerns the role of diagrams and visual reasoning in proofs—which I take to concern the criteria of legitimate representation of mathematical thought. Drawing on the so-called ‘maverick’ approach to philosophy of mathematics, I turn to mathematical practice itself to adjudicate in this debate, and in particular to category theory, because there (a) diagrams obviously play a major role, and (b) category theory itself (...) addresses questions of representation and information preservation over mappings. We obtain a mathematical answer to a philosophical question: a good mathematical representation can be characterized as a category theoretic natural transformation. (shrink)

Roger White (2015) sketches an ingenious new solution to the problem of induction. He argues from the principle of indifference for the conclusion that the world is more likely to be induction- friendly than induction-unfriendly. But there is reason to be skeptical about the proposed indifference-based vindication of induction. It can be shown that, in the crucial test cases White concentrates on, the assumption of indifference renders induction no more accurate than random guessing. After discussing this result, the paper explains (...) why the indifference-based argument seemed so compelling, despite ultimately being unsound. (shrink)

In Winter 2017, the first author piloted a course in formal logic in which we aimed to (a) improve student engagement and mastery of the content, and (b) reduce maths anxiety and its negative effects on student outcomes, by adopting student oriented teaching including peer instruction and classroom flipping techniques. The course implemented a partially flipped approach, and incorporated group-work and peer learning elements, while retaining some of the traditional lecture format. By doing this, a wide variety of student learning (...) preferences could be provided for. (shrink)