The PBR theorem gives insight into how quantum mechanics describes a physical system. This paper explores PBRs’ general result and shows that it does not disallow the ensemble interpretation of quantum mechanics and maintains, as it must, the fundamentally statistical character of quantum mechanics. This is illustrated by drawing an analogy with an ideal gas. An ensemble interpretation of the Schrödinger cat experiment that does not violate the PBR conclusion is also given. The ramifications, limits, and weaknesses of the (...) PBR assumptions, especially in light of lessons learned from Bell’s theorem, are elucidated. It is shown that, if valid, PBRs’ conclusion specifies what type of ensemble interpretations are possible. The PBR conclusion would require a more direct correspondence between the quantum state ) and the reality it describes than might otherwise be expected. A simple terminology is introduced to clarify this greater correspondence. (shrink)

Protective measurements illustrate how Yakir Aharonov's fundamental insights into quantum theory yield new experimental paradigms that allow us to test quantum mechanics in ways that were not possible before. As for quantum theory itself, protective measurements demonstrate that a quantum state describes a single system, not only an ensemble of systems, and reveal a rich ontology in the quantum state of a single system. We discuss in what sense protective measurements anticipate the theorem of Pusey, Barrett, and Rudolph (PBR), (...) stating that, if quantum predictions are correct, then two distinct quantum states cannot represent the same physical reality. (shrink)

According to Relational Quantum Mechanics the wave function \ is considered neither a concrete physical item evolving in spacetime, nor an object representing the absolute state of a certain quantum system. In this interpretative framework, \ is defined as a computational device encoding observers’ information; hence, RQM offers a somewhat epistemic view of the wave function. This perspective seems to be at odds with the PBR theorem, a formal result excluding that wave functions represent knowledge of an underlying reality (...) described by some ontic state. In this paper we argue that RQM is not affected by the conclusions of PBR’s argument; consequently, the alleged inconsistency can be dissolved. To do that, we will thoroughly discuss the very foundations of the PBR theorem, i.e. Harrigan and Spekkens’ categorization of ontological models, showing that their implicit assumptions about the nature of the ontic state are incompatible with the main tenets of RQM. Then, we will ask whether it is possible to derive a relational PBR-type result, answering in the negative. This conclusion shows some limitations of this theorem not yet discussed in the literature. (shrink)

The PBR theorem, which implies that the Einsteinian realist view on quantum mechanics (QM) is inconsistent with predictions of the standard Copenhagen view on QM, has been hailed as one of the most important theorems in the foundations of QM. Here we show that the special measurement, used by Pusey et al. to derive the theorem, is nonexisting from the Einsteinian view on QM.

The meaning of the wave function is an important unresolved issue in Bohmian mechanics. On the one hand, according to the nomological view, the wave function of the universe or the universal wave function is nomological, like a law of nature. On the other hand, the PBR theorem proves that the wave function in quantum mechanics or the effective wave function in Bohmian mechanics is ontic, representing the ontic state of a physical system in the universe. It is usually (...) thought that the nomological view of the universal wave function is compatible with the ontic view of the effective wave function, and thus the PBR theorem has no implications for the nomological view. In this paper, I argue that this is not the case, and these two views are in fact incompatible. This means that if the effective wave function is ontic as the PBR theorem proves, then the universal wave function cannot be nomological, and the ontology of Bohmian mechanics cannot consist only in particles. This incompatibility result holds true not only for Humeanism and dispositionalism but also for primitivism about laws of nature, which attributes a fundamental ontic role to the universal wave function. Moreover, I argue that although the nomological view can be held by rejecting one key assumption of the PBR theorem, the rejection will lead to serious problems, such as that the results of measurements and their probabilities cannot be explained in ontology in Bohmian mechanics. Finally, I briefly discuss three $$\psi$$ -ontologies, namely a physical field in a fundamental high-dimensional space, a multi-field in three-dimensional space, and RDMP (Random Discontinuous Motion of Particles) in three-dimensional space, and argue that the RDMP ontology can answer the objections to the $$\psi$$ -ontology raised by the proponents of the nomological view. (shrink)

The ontological status of the wave function in quantum mechanics has been analyzed in the context of conventional projective measurements. These analyses are usually based on some nontrivial assumptions, e.g. a preparation independence assumption is needed to prove the PBR theorem. In this paper, we give a PBR-like argument for psi-ontology in terms of protective measurements, by which one can directly measure the expectation values of observables on a single quantum system. The proof does not resort to nontrivial assumptions (...) such as preparation independence assumption. (shrink)

In this paper we show that ψ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi$$\end{document}-ontic models, as defined by Harrigan and Spekkens (HS), cannot reproduce quantum theory. Instead of focusing on probability, we use information theoretic considerations to show that all pure states of ψ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi$$\end{document}-ontic models must be orthogonal to each other, in clear violation of quantum mechanics. Given that (i) Pusey, Barrett and Rudolph (PBR) previously showed that ψ\documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi$$\end{document}-epistemic models, as defined by HS, also contradict quantum mechanics, and (ii) the HS categorization is exhausted by these two types of models, we conclude that the HS categorization itself is problematic as it leaves no space for models that can reproduce quantum theory. (shrink)

Based on an analysis of protective measurements, we show that the quantum state represents the physical state of a single quantum system. This result is more definite than the PBR theorem [Pusey, Barrett, and Rudolph, Nature Phys. 8, 475 (2012)].

Quantum mechanics is an extraordinarily successful scientific theory. But more than 100 years after it was first introduced, the interpretation of the theory remains controversial. This Element introduces some of the most puzzling questions at the foundations of quantum mechanics and provides an up-to-date and forward-looking survey of the most prominent ways in which physicists and philosophers of physics have attempted to resolve them. Topics covered include nonlocality, contextuality, the reality of the wavefunction and the measurement problem. The discussion is (...) supplemented with descriptions of some of the most important mathematical results from recent work in quantum foundations, including Bell's theorem, the Kochen-Specker theorem and the PBR theorem. (shrink)

According to the current epistemic interpretation of quantum probabilities, the quantum correlations manifesting nonlocality can be derived from purely probabilistic and information-theoretic constraints. As such, they do not constitute a spacetime phenomenon and cannot lead to conflict between QM and any spatial-temporal constraints. This paper compares recent epistemic interpretations with earlier probabilistic interpretations, noting their merits as well as the difficulties they encounter. In particular, the implications of the recent PBR theorem are examined. While generally seen as undermining the (...) epistemic interpretation, I argue that the PBR theorem actually suggests an epistemic position more radical than previously ones. This review of probabilistic interpretations enables reassessment of the epistemic theorist's attempt to disentangle nonlocality from spacetime considerations. (shrink)

Quantum cognition is a new theoretical framework for constructing cognitive models based on the mathematical principles of quantum theory. Due to its increasing empirical success, one wonders what it tells us about the underlying process of cognition. Does it imply that we have quantum minds and there is some sort of quantum structure in the brain? In this paper, I address this important issue by using a new result in the research of quantum foundations. Based on the PBR theorem (...) about the reality of the wave function, I show, given certain assumptions, that the wave function assigned to a cognitive system such as our brain, which is used to calculate probabilities of thoughts/judgment outcomes in quantum cognition, is a real representation of the cognitive state of the system, not a mere representation of incomplete knowledge about the state of the system. This result supports a realist interpretation of quantum cognition, according to which the cognitive state of our brain and its dynamics are not classical but quantum in quantum cognition. In short, quantum cognition implies quantum minds. However, this result does not mean that we have quantum minds and our brain is a quantum computer, since quantum cognition by its standard formulation has not been fully confirmed by experiments. The hope is that more crucial experiments can be done in the near future to determine whether or not quantum cognition is real. (shrink)

Recently the first protective measurement has been realized in experiment [Nature Phys. 13, 1191 ], which can measure the expectation value of an observable from a single quantum system. This raises an important and pressing issue of whether protective measurement implies the reality of the wave function. If the answer is yes, this will improve the influential PBR theorem [Nature Phys. 8, 475 ] by removing auxiliary assumptions, and help settle the issue about the nature of the wave function. (...) In this paper, we demonstrate that this is indeed the case. It is shown that a psi-epistemic model and quantum mechanics have different predictions about the variance of the result of a Zeno-type protective measurement with finite N. (shrink)

What is the meaning of the wave-function? After almost 100 years since the inception of quantum mechanics, is it still possible to say something new on what the wave-function is supposed to be? Yes, it is. And Shan Gao managed to do so with his newest book. Here we learn what contemporary physicists and philosophers think about the wave-function; we learn about the de Broglie-Bohm theory, the GRW collapse theory, the gravity-induced collapse theory by Roger Penrose, and the famous PBR (...) theorem; we learn about Schrödinger's original idea that the wave-function represents charge densities; we learn about the notorious measurement problem and its consequences; we learn about the challenges to find a consistent relativistic quantum theory; and we learn, of course, Gao's own suggestion for the status of the wave-function. Above all, Gao shows us the significance of protective measurements for our search of the ontology of quantum mechanics. Still not widely recognized among physicists and philosophers, protective measurements let us look deeper into quantum mechanics. For Gao this is the main tool to settle the issue on the ontological status of the wave-function: the wave-function is real because one can measure it. (shrink)

Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either of these foundational purposes, and that recent attempts to defend the foundational importance of representation theorems are unsuccessful. As a result, we (...) should reject these claims, and lay the foundations of decision theory on firmer ground. (shrink)

Microalgae in the wild often form consortia with other species promoting their own health and resource foraging opportunities. The recent application of microalgae cultivation and deployment in commercial photobioreactors (PBR) so far has focussed on single species of algae, resulting in multi-species consortia being largely unexplored. Reviewing the current status of PBR ecological habitat, this article argues in favor of further investigation into algal communication with conspecifics and interspecifics, including other strains of microalgae and bacteria. These mutualistic species form the (...) ‘phycosphere’: the micro-environment surrounding microalgal cells, potentiating the production of certain metabolites through biochemical interaction with cohabitating microorganisms. A better understanding of the phycosphere could lead to novel PBR configurations, capable of incorporating algal-microbial consortia, potentially proving more effective than single-species algal systems. (shrink)

Jury theorems are mathematical theorems about the ability of collectives to make correct decisions. Several jury theorems carry the optimistic message that, in suitable circumstances, ‘crowds are wise’: many individuals together (using, for instance, majority voting) tend to make good decisions, outperforming fewer or just one individual. Jury theorems form the technical core of epistemic arguments for democracy, and provide probabilistic tools for reasoning about the epistemic quality of collective decisions. The popularity of jury theorems spans across various disciplines such (...) as economics, political science, philosophy, and computer science. This entry reviews and critically assesses a variety of jury theorems. It first discusses Condorcet's initial jury theorem, and then progressively introduces jury theorems with more appropriate premises and conclusions. It explains the philosophical foundations, and relates jury theorems to diversity, deliberation, shared evidence, shared perspectives, and other phenomena. It finally connects jury theorems to their historical background and to democratic theory, social epistemology, and social choice theory. (shrink)

In this short survey article, I discuss Bell’s theorem and some strategies that attempt to avoid the conclusion of non-locality. I focus on two that intersect with the philosophy of probability: (1) quantum probabilities and (2) superdeterminism. The issues they raised not only apply to a wide class of no-go theorems about quantum mechanics but are also of general philosophical interest.

Peer review is often taken to be the main form of quality control on academic research. Usually journals carry this out. However, parts of maths and physics appear to have a parallel, crowd-sourced model of peer review, where papers are posted on the arXiv to be publicly discussed. In this paper we argue that crowd-sourced peer review is likely to do better than journal-solicited peer review at sorting papers by quality. Our argument rests on two key claims. First, crowd-sourced peer (...) review will lead on average to more reviewers per paper than journal-solicited peer review. Second, due to the wisdom of the crowds, more reviewers will tend to make better judgments than fewer. We make the second claim precise by looking at the Condorcet Jury Theorem as well as two related jury theorems developed specifically to apply to peer review. (shrink)

The book begins with an overview that introduces the Theorem and the issues surrounding it, and explores how the essays that follow contribute to our understanding of those issues.

Following the argument of Pusey et al. (in Nature Phys. 8:476, 2012), new interest has been raised on whether one can interpret state-vectors (pure states) in a statistical way (ψ-epistemic theories), or if each one of them corresponds to a different ontological entity. Each interpretation of quantum theory assumes different ontology and one could ask if the PBR argument carries over. Here we examine this question for histories formulations in general with particular attention to the co-event formulation. State-vectors appear as (...) the initial state that enters into the quantum measure. While the PBR argument goes through up to a point, the failure to meet some of the assumptions they made does not allow one to reach their conclusion. However, the author believes that the “statistical interpretation” is still impossible for co-events even if this is not proven by the PBR argument. (shrink)

This paper introduces Agreement Theorems to dynamic-epistemic logic. We show first that common belief of posteriors is sufficient for agreement in epistemic-plausibility models, under common and well-founded priors. We do not restrict ourselves to the finite case, showing that in countable structures the results hold if and only if the underlying plausibility ordering is well-founded. We then show that neither well-foundedness nor common priors are expressible in the language commonly used to describe and reason about epistemic-plausibility models. The static agreement (...) result is, however, finitely derivable in an extended modal logic. We provide the full derivation. We finally consider dynamic agreement results. We show they have a counterpart in epistemic-plausibility models, and provide a new form of agreements via public announcements. (shrink)

We give a review and critique of jury theorems from a social-epistemology perspective, covering Condorcet’s (1785) classic theorem and several later refinements and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the ‘wisdom of crowds’. In particular, we argue (i) that there is a fundamental tension between voters’ independence and voters’ competence, hence between the two premises of most jury theorems; (...) (ii) that the (asymptotic) conclusion that ‘huge groups are infallible’, reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (nonasymptotic) conclusion that ‘larger groups are more reliable’, also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the ‘wisdom of crowds’. (shrink)

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ (...) - and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

The representation theorems of expected utility theory show that having certain types of preferences is both necessary and sufficient for being representable as having subjective probabilities. However, unless the expected utility framework is simply assumed, such preferences are also consistent with being representable as having degrees of belief that do not obey the laws of probability. This fact shows that being representable as having subjective probabilities is not necessarily the same as having subjective probabilities. Probabilism can be defended on the (...) basis of the representation theorems only if attributions of degrees of belief are understood either antirealistically or purely qualitatively, or if the representation theorems are supplemented by arguments based on other considerations (simplicity, consilience, and so on) that single out the representation of a person as having subjective probabilities as the only true representation of the mental state of any person whose preferences conform to the axioms of expected utility theory. (shrink)

According to a recent paper by Tim Maudlin, Bell’s theorem has nothing to tell us about realism or the descriptive completeness of quantum mechanics. What it shows is that quantum mechanics is non-local, no more and no less. What I intend to do in this paper is to challenge Maudlin’s assertion about the import of Bell’s proof. There is much that I agree with in the paper; in particular, it does us the valuable service of demonstrating that Einstein’s objections (...) to quantum mechanics have nothing to do with its indeterminism. But I do think that Maudlin’s conclusion is overly cut-and-dried. Quantum mechanics is far from a unified edifice, and what Bell’s theorem shows depends on what version of quantum mechanics you look at. In particular, I’ll try to make the case that there’s an interesting, if ultimately uncompelling anti-realist construal of the import of Bell’s theorem. And I also want to suggest that locality isn’t quite as decisively defeated as Maudlin claims. (shrink)

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4–9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.

Theorems of hyperarithmetic analysis occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed iterations of the Turing jump but below ATR $_{0}$. There is a long history of proof-theoretic principles which are THAs. Until the papers reported on in this communication, there was only one mathematical example. Barnes, Goh, and Shore [1] analyze an array of ubiquity theorems in graph theory descended from Halin’s [9] work on rays in graphs. They (...) seem to be typical applications of ACA $_{0}$ but are actually THAs. These results answer Question 30 of Montalbán’s Open Questions in Reverse Mathematics [19] and supply several other natural principles of different and unusual levels of complexity.This work led in [25] to a new neighborhood of the reverse mathematical zoo: almost theorems of hyperarithmetic analysis. When combined with ACA $_{0}$ they are THAs but on their own are very weak. Denizens both mathematical and logical are provided. Generalizations of several conservativity classes are defined and these ATHAs as well as many other principles are shown to be conservative over RCA $_{0}$ in all these senses and weak in other recursion-theoretic ways as well. These results answer a question raised by Hirschfeldt and reported in [19] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong or very strong going up a standard hierarchy and at the end being stronger than full second-order arithmetic. (shrink)

The classesMatr( ) of all matrices (models) for structural finitistic entailments are investigated. The purpose of the paper is to prove three theorems: Theorem I.7, being the counterpart of the main theorem from Czelakowski [3], and Theorems II.2 and III.2 being the entailment counterparts of Bloom's results [1]. Theorem I.7 states that if a classK of matrices is adequate for , thenMatr( ) is the least class of matrices containingK and closed under the formation of ultraproducts, submatrices, (...) strict homomorphisms and strict homomorphic pre-images. Theorem II.2 in Section II gives sufficient and necessary conditions for a structural entailment to be finitistic. Section III contains theorems which characterize finitely based entailments. (shrink)

It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko's theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via a double negation interpretation. Our presentation is algebraic and is formulated in the context of residuated lattices. In the (...) last part of the paper, we also discuss some extended forms of the Kolmogorov translation and we compare it to the Glivenko translation. (shrink)

We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.

Linear continuous logic is the fragment of continuous logic obtained by restricting connectives to addition and scalar multiplications. Most results in the full continuous logic have a counterpart in this fragment. In particular a linear form of the compactness theorem holds. We prove this variant and use it to deduce some basic preservation theorems.

Bayes' Theorem is a simple mathematical formula used for calculating conditional probabilities. It figures prominently in subjectivist or Bayesian approaches to epistemology, statistics, and inductive logic. Subjectivists, who maintain that rational belief is governed by the laws of probability, lean heavily on conditional probabilities in their theories of evidence and their models of empirical learning. Bayes' Theorem is central to these enterprises both because it simplifies the calculation of conditional probabilities and because it clarifies significant features of subjectivist (...) position. Indeed, the Theorem's central insight — that a hypothesis is confirmed by any body of data that its truth renders probable — is the cornerstone of all subjectivist methodology. (shrink)

It might seem that three of Godel’s results - the Completeness and the First and Second Incompleteness Theorems - assume so little that they are reasonably indisputable. A version of the Completeness Theorem, for instance, can be proven in RCA0, which is the weakest system studied extensively in Simpson’s encyclopaedic Subsystems of Second Order Arithmetic. And it often seems that the minimum requirements for a system just to express the Incompleteness Theorems are sufficient to prove them. However, it will (...) be shown that a particular sub-system of Peano Arithmetic is powerful enough to express assertions about syntax, provability, consistency, and models, while being too weak to allow the standard proofs of the theorems to go through. An alternative proof is available for the First Incompleteness Theorem, but is of such a different nature that the import of the theorem changes. And there are no alternative proofs for (certainly) the Completeness and (apparently) the Second Incompleteness Theorems. It is therefore perfectly rational for someone to be skeptical about Godel’s results. (shrink)

Linnebo and Shapiro have recently given an analysis of potential infinity using modal logic. A key technical component of their account is to show that under a suitable translation ◊ of nonmodal language into modal language, nonmodal sentences ϕ 1, …, ϕ n entail ψ just in case ϕ 1 ◊, …, ϕ n ◊ entail ψ ◊ in the modal logic S4.2. Linnebo and Shapiro establish this result in nonfree logic. In this note I argue that their analysis of (...) potential infinity should be carried out in a free logic. I then extend their key theorems to the setting of negative free logic. (shrink)

Accessing knowledge of a single knowledge source with different client applications often requires the help of mediator systems as middleware components. In the domain of theorem proving large efforts have been made to formalize knowledge for mathematics and verification issues, and to structure it in databases. But these databases are either specialized for a single client, or if the knowledge is stored in a general database, the services this database can provide are usually limited and hard to adjust for (...) a particular theorem prover. Only recently there have been initiatives to flexibly connect existing theorem proving systems into networked environments that contain large knowledge bases. An intermediate layer containing both, search and proving functionality can be used to mediate between the two. In this paper we motivate the need and discuss the requirements for mediators between mathematical knowledge bases and theorem proving systems. We also present an attempt at a concurrent mediator between a knowledge base and a proof planning system. (shrink)

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, (...) machine learning results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)

Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFLe. It is shown that there exists the weakest logic over QFLe among substructural predicate logics for which the Glivenko theorem holds. Negative translations of substructural predicate logics are studied by (...) using the same approach. First, a negative translation, called extended Kuroda translation is introduced. Then a translation result of an arbitrary involutive substructural predicate logics over QFLe is shown, and the existence of the weakest logic is proved among such logics for which the extended Kuroda translation works. They are obtained by a slight modification of the proof of the Glivenko theorem. Relations of our extended Kuroda translation with other standard negative translations will be discussed. Lastly, algebraic aspects of these results will be mentioned briefly. In this way, a clear and comprehensive understanding of Glivenko theorems and negative translations will be obtained from a substructural viewpoint. (shrink)

Gödel's two incompleteness theorems are among the most important results in modern logic, and have deep implications for various issues. They concern the limits of provability in formal axiomatic theories. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. According to the second incompleteness theorem, such a formal (...) system cannot prove that the system itself is consistent (assuming it is indeed consistent). These results have had a great impact on the philosophy of mathematics and logic. There have been attempts to apply the results also in other areas of philosophy such as the philosophy of mind, but these attempted applications are more controversial. The present entry surveys the two incompleteness theorems and various issues surrounding them. (shrink)

Two partition-theorems are proved for a particular causal decision theory. One is restricted to a certain kind of partition of circumstances, and analyzes the utility of an option in terms of its utilities in conjunction with circumstances in this partition. The other analyzes an option's utility in terms of its utilities conditional on circumstances and is quite unrestricted. While the first form seems more useful for applications, the second form may be of theoretical importance in foundational exercises. Comparisons are made (...) with theorems of Richard Jeffrey, Brad Armendt, and Peter Fishburn. (shrink)

Contemporary decision theory places crucial emphasis on a family of mathematical results called representation theorems, which relate criteria for evaluating the available options to axioms pertaining to the decision-maker’s preferences. Various claims have been made concerning the reasons for the importance of these results. The goal of this article is to assess their semantic role: representation theorems are purported to provide definitions of the decision-theoretic concepts involved in the evaluation criteria. In particular, this claim shall be examined from the perspective (...) of philosophical theories of the meaning of theoretical terms. (shrink)

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf {PA}$ and intuitionistic arithmetic $\mathsf {HA}$. Using a generalized negative translation, we first provide a structured proof of the fact that $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over $\mathsf {HA} + {\Sigma _k}\text {-}\mathrm {LEM}$ where ${\Sigma _k}\text {-}\mathrm {LEM}$ is the axiom scheme of the law-of-excluded-middle restricted to formulas in $\Sigma _k$. In addition, we show that this conservation theorem is optimal in (...) the sense that for any semi-classical arithmetic T, if $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over T, then ${T}$ proves ${\Sigma _k}\text {-}\mathrm {LEM}$. In the same manner, we also characterize conservation theorems for other well-studied classes of formulas by fragments of classical axioms or rules. This reveals the entire structure of conservation theorems with respect to the arithmetical hierarchy of classical principles. (shrink)

Two characterizations are given of those structural consequence operations on a propositional language which can be defined via proofs from a finite number of polynomial rules.

A fundamental problem in science is how to make logical inferences from scientific data. Mere data does not suffice since additional information is necessary to select a domain of models or hypotheses and thus determine the likelihood of each model or hypothesis. Thomas Bayes’ Theorem relates the data and prior information to posterior probabilities associated with differing models or hypotheses and thus is useful in identifying the roles played by the known data and the assumed prior information when making (...) inferences. Scientists, philosophers, and theologians accumulate knowledge when analyzing different aspects of reality and search for particular hypotheses or models to fit their respective subject matters. Of course, a main goal is then to integrate all kinds of knowledge into an all-encompassing worldview that would describe the whole of reality. A generous description of the whole of reality would span, in the order of complexity, from the purely physical to the supernatural. These two extreme aspects of reality are bridged by a nonphysical realm, which would include elements of life, man, consciousness, rationality, mental and mathematical abstractions, etc. An urgent problem in the theory of knowledge is what science is and what it is not. Albert Einstein’s notion of science in terms of sense perception is refined by defining operationally the data that makes up the subject matter of science. It is shown, for instance, that theological considerations included in the prior information assumed by Isaac Newton is irrelevant in relating the data logically to the model or hypothesis. In addition, the concepts of naturalism, intelligent design, and evolutionary theory are critically analyzed. Finally, Eugene P. Wigner’s suggestions concerning the nature of human consciousness, life, and the success of mathematics in the natural sciences is considered in the context of the creative power endowed in humans by God. (shrink)

Suppose $D \subset M$ is a strongly minimal set definable in M with parameters from C. We say D is locally modular if for all $X, Y \subset D$ , with $X = \operatorname{acl}(X \cup C) \cap D, Y = \operatorname{acl}(Y \cup C) \cap D$ and $X \cap Y \neq \varnothing$ , dim(X ∪ Y) + dim(X ∩ Y) = dim(X) + dim(Y). We prove the following theorems. Theorem 1. Suppose M is stable and $D \subset M$ is strongly (...) minimal. If D is not locally modular then in M eq there is a definable pseudoplane. (For a discussion of M eq see [M, § A].) This is the main part of Theorem 1 of [Z2] and the trichotomy theorem of [Z3]. Theorem 2. Suppose M is stable and $D, D' \subset M$ are strongly minimal and nonorthogonal. Then D is locally modular if and only if D' is locally modular. (shrink)

A discussion of the connections and differences between completeness and representation theorems in logic, with examples drawn from classical and modal logic, the logic of friendliness, and nonmonotonic reasoning.

I discuss classical and quantum recurrence theorems in a unified manner, treating both as generalisations of the fact that a system with a finite state space only has so many places to go. Along the way I prove versions of the recurrence theorem applicable to dynamics on linear and metric spaces, and make some comments about applications of the classical recurrence theorem in the foundations of statistical mechanics.