In general, analyses of voting power are performed through the notion of a simple voting game (SVG) in which every voter can choose between two options: ‘yes’ or ‘no’. Felsenthal and Machover [Felsenthal, D.S. and Machover, M. (1997), International Journal of Game Theory 26, 335–351.] introduced the concept of ternary voting games (TVGs) which recognizes abstention alongside. They derive appropriate generalizations of the Shapley–Shubik and Banzhaf indices in TVGs. Braham and Steffen [Braham, M. and Steffen, F. (2002), in Holler, et (...) al. (eds.), Power and Fairness, Jahrbuch für Neue Politische Ökonomie 20, Mohr Siebeck, pp. 333–348.] argued that the decision-making structure of a TVG may not be justified. They propose a sequential structure in which voters first decide between participation and abstention and then between ‘yes’ or ‘no’. The purpose of this paper is two-fold. First, we compare the two approaches and show how the probabilistic interpretation of power provides a unifying characterization of analogues of the Banzhaf (Bz) measure. Second, using the probabilistic approach we shall prove a special case of Penrose’s Limit Theorem (PLT). This theorem deals with an asymptotic property in weighted voting games with an increasing number of voters. It says that under certain conditions the ratio between the voting power of any two voters (according to various measures of voting power) approaches the ratio between their weights. We show that PLT holds in TVGs for analogues of Bz measures, irrespective of the particular nature of abstention. (shrink)

Traditionally, many writers, following Kleene (1952), thought of the Church-Turing thesis as unprovable by its nature but having various strong arguments in its favor, including Turing’s analysis of human computation. More recently, the beauty, power, and obvious fundamental importance of this analysis, what Turing (1936) calls “argument I,” has led some writers to give an almost exclusive emphasis on this argument as the unique justification for the Church-Turing thesis. In this chapter I advocate an alternative justification, essentially presupposed by Turing (...) himself in what he calls “argument II.” The idea is that computation is a special form of mathematical deduction. Assuming the steps of the deduction can be stated in a first order language, the Church-Turing thesis follows as a special case of Gödel’s completeness theorem (first order algorithm theorem). I propose this idea as an alternative foundation for the Church-Turing thesis, both for human and machine computation. Clearly the relevant assumptions are justified for computations presently known. Other issues, such as the significance of Gödel’s 1931 Theorem IX for the Entscheidungsproblem, are discussed along the way. (shrink)

Metalogic is an open-ended cognitive, formal methodology pertaining to semantics and information processing. The language that mathematizes metalogic is known as metalanguage and deals with metafunctions purely by extension on patterns. A metalogical process involves an effective enrichment in knowledge as logical statements, and, since human cognition is an inherently logic–based representation of knowledge, a metalogical process will always be aimed at developing the scope of cognition by exploring possible cognitive implications reflected on successive levels of abstraction. Indeed, it is (...) basically impracticable to maintain logic–and–metalogic without paying heed to cognitive theorizing. For it is cognitively irrelevant whether possible conclusions are deduced from some premises before the premises are determined to be true or whether the premises themselves are determined to be true first and, then, the conclusions are deduced from them. In this paper we consider the term metalogic as inherently embodied under the framework referred to as cognitive science and mathematics. We propose a metalogical interpretation of Arrow’s impossibility theorem and, to that end, choice theory is understood as a mental course of action dealing with logic and metalogic issues, in which a possible mathematical approach to model a mental course of action is adopted as a systematic operating method. Nevertheless, if we look closely at the core of Arrow’s impossibility theorem in terms of metalogic, a second fundamental contribution to this framework is represented by the Nash equilibrium. As a result of the foregoing, therefore, we prove the metalogical equivalence between Arrow’s impossibility theorem and the existence of the Nash equilibrium. More specifically, Arrow’s requirements correspond to the Nash equilibrium for finite mixed strategies with no symmetry conditions. To demonstrate this proof, we first verify that Arrow’s set and Nash’s set are isomorphic to each other, both sets being under stated conditions of non–symmetry. Then, the proof is completed by virtue of category theory. Indeed, the two sets are categories that correspond biuniquely to one another and, thus, it is possible to define a covariant functor that preserves their mutual structures. According to this, we show the proof–dedicated metalanguage as a precursor to a special equivalence theorem. (shrink)

The theorem of Bell states that certain results of quantum mechanics violate inequalities that are valid for objective local random variables. We show that the inequalities of Bell are special cases of theorems found 10 years earlier by Bass and stated in full generality by Vorob’ev. This fact implies precise necessary and sufficient mathematical conditions for the validity of the Bell inequalities. We show that these precise conditions differ significantly from the definition of objective local variable spaces and (...) as an application that the Bell inequalities may be violated even for objective local random variables. (shrink)

Infinitary languages are used to prove that any strong isomorphism of substructures of isomorphic structures can be extended to an isomorphism of the structures. If the structures are models of a theory that has quantifier elimination, any isomorphism of substructures is strong. This theorem is a partial generalization of Steinitz’s theorem for algebraically closed fields and has as special case the analogous theorem for differentially closed fields. In this note, we announce results which will be (...) proved elsewhere. DOI: 10.5007/1808-1711.2011v15n1p107. (shrink)

LS Penrose was the first to propose a measure of voting power (which later came to be known as ‘the [absolute] Banzhaf index’). His limit theorem – which is implicit in Penrose (1952) and for which he gave no rigorous proof – says that, in simple weighted voting games, if the number of voters increases indefinitely while the quota is pegged at half the total weight, then – under certain conditions – the ratio between the voting powers (as measured (...) by him) of any two voters converges to the ratio between their weights. We conjecture that the theorem holds, under rather general conditions, for large classes of variously defined weighted voting games, other values of the quota, and other measures of voting power. We provide proofs for some special cases. (shrink)

By formalizing Berry's paradox, Vopěnka, Chaitin, Boolos and others proved the incompleteness theorems without using the diagonal argument. In this paper, we shall examine these proofs closely and show their relationships. Firstly, we shall show that we can use the diagonal argument for proofs of the incompleteness theorems based on Berry's paradox. Then, we shall show that an extension of Boolos' proof can be considered as a special case of Chaitin's proof by defining a suitable Kolmogorov complexity. We (...) shall show also that Vopěnka's proof can be reformulated in arithmetic by using the arithmetized completeness theorem. (shrink)

In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. (...) Although we thereby provide a new proof of Arrow’s theorem, our main aim is to identify the analogue of Arrow’s theorem in judgment aggregation, to clarify the relation between judgment and preference aggregation, and to illustrate the generality of the judgment aggregation model. JEL Classi…cation: D70, D71.. (shrink)

It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, (...) say, Delta-3-1 comprehension axioms are not logical truths. What I am going to suggest, however, is that there is a special case to be made on behalf of Pi-1-1 comprehension. Making the case involves investigating extensions of first-order logic that do not rely upon the presence of second-order quantifiers. A formal system for so-called "ancestral logic" is developed, and it is then extended to yield what I call "Arché logic". (shrink)

Ibn al-Zarqālluh (al-Andalus, d. 1100) introduced a new inequality in the longitudinal motion of the Moon into Ptolemy’s lunar model with the amplitude of 24′, which periodically changes in terms of a sine function with the distance in longitude between the mean Moon and the solar apogee as the variable. It can be shown that the discovery had its roots in his examination of the discrepancies between the times of the lunar eclipses he obtained from the data of his (...) eclipse observations over a 37-year period in the latter part of the eleventh century and the predictions made on the basis of the lunar theories in the Mumta $$\textit{\d{h}}$$ an zīj (Baghdad, ca. 830) and al-Battānī’s zīj (Raqqa, d. 929), which were available to him at the time. What Ibn al-Zarqālluh found is, in fact, a special case of the annual equation of the Moon, which is applicable in the oppositions and, thus, in the lunar eclipses. The inequality was discovered independently by Tycho Brahe (d. 1601) and Johannes Kepler (d. 1630). As Ibn Yūnus (d. 1009) reports in his $$\textit{\d{H}}$$ ākimī zīj, Ibn al-Zarqālluh’s medieval Middle Eastern predecessors, the Persian astronomers Māhānī (d. ca. 880) and Nayrīzī (d. 922) as well as ‘Alī b. Amājūr (fl. ca. 920), were already acquainted with the problem of the eclipse timing errors, but it had remained unresolved until Ibn Yūnus provided a provisional, and incorrect, solution by reducing the size of the lunar epicycle. As we argue, the diverse ways to tackle the same problem stem from two different methodologies in astronomical reasoning in the traditions developed separately in the Eastern and Western regions of the medieval Islamic domain. (shrink)

de Finetti's representation theorem of exchangeable probabilities as unique mixtures of Bernoullian probabilities is a special case of a result known as the ergodic decomposition theorem. It says that stationary probability measures are unique mixtures of ergodic measures. Stationarity implies convergence of relative frequencies, and ergodicity the uniqueness of limits. Ergodicity therefore captures exactly the idea of objective probability as a limit of relative frequency (up to a set of measure zero), without the unnecessary restriction to (...) probabilistically independent events as in de Finetti's theorem. The ergodic decomposition has in some applications to dynamical systems a physical content, and de Finetti's reductionist interpretation of his result is not adequate in these cases. (shrink)

In 1978, Yu. F. Borisov presented an axiom system using a few basic assumptions and four explicit axioms, the fourth being a formulation of the relativity principle; and he demonstrated that this axiom system had (up to choice of units) only two models: a relativistic one in which worldview transformations are Poincaré transformations and a classical one in which they are Galilean. In this paper, we reformulate Borisov’s original four axioms within an intuitively simple, but strictly formal, first-order logic framework, (...) and convert his basic background assumptions into explicit axioms. Instead of assuming that the structure of physical quantities is the field of real numbers, we assume only that they form an ordered field. This allows us to investigate how Borisov’s theorem depends on the structure of quantities. We demonstrate (as our main contribution) how to construct Euclidean, Galilean, and Poincaré models of Borisov’s axiom system over every non-Archimedean field. We also demonstrate the existence of an infinite descending chain of models and transformation groups in each of these three cases, something that is not possible over Archimedean fields. As an application, we note that there is a model of Borisov’s axioms that satisfies the relativity principle, and in which the worldview transformations are Euclidean isometries. Over the field of reals it is easy to eliminate this model using natural axioms concerning time’s arrow and the absence of instantaneous motion. In the case of non-Archimedean fields, however, the Euclidean isometries appear intrinsically as worldview transformations in models of Borisov’s axioms and neither the assumption of time’s arrow, nor the rejection of instantaneous motion, can eliminate them. (shrink)

L S Penrose’s Limit Theorem – which is implicit in Penrose [7, p. 72] and for which he gave no rigorous proof – says that, in simple weighted voting games, if the number of voters increases indefinitely and the relative quota is pegged, then – under certain conditions – the ratio between the voting powers of any two voters converges to the ratio between their weights. Lindner and Machover [4] prove some special cases of Penrose’s Limit Theorem. (...) They give a simple counter-example showing that the theorem does not hold in general even under the conditions assumed by Penrose; but they conjecture, in effect, that under rather general conditions it holds ‘almost always’ – that is with probability 1 – for large classes of weighted voting games, for various values of the quota, and with respect to several measures of voting power. We use simulation to test this conjecture. It is corroborated with respect to the Penrose–Banzhaf index for a quota of 50% but not for other values; with respect to the Shapley–Shubik index the conjecture is corroborated for all values of the quota. (shrink)

A new approach to quantum theory is proposed in this paper. The basis is taken to be theoretical variables, variables that may be accessible or inaccessible, i.e., it may be possible or impossible for an observer to assign arbitrarily sharp numerical values to them. In an epistemic process, the accessible variables are just ideal observations connected to an observer or to some communicating observers. Group actions are defined on these variables, and group representation theory is the basis for developing the (...) Hilbert space formalism here. Operators corresponding to accessible theoretical variables are derived, and in the discrete case, it is proved that the possible physical values are the eigenvalues of these operators. The focus of the paper is some mathematical theorems paving the ground for the proposed foundation of quantum theory. It is shown here that the groups and transformations needed in this approach can be constructed explicitly in the case where the accessible variables are finite-dimensional. This simplifies the theory considerably: To reproduce the Hilbert space formulation, it is enough to assume the existence of two complementary variables. The interpretation inferred from the proposed foundation here may be called a general epistemic interpretation of quantum theory. A special case of this interpretation is QBism; it also has a relationship to several other interpretations. (shrink)

Remarks on the Foundations of Mathematics, Wittgenstein, despite his official 'mathematical nonrevisionism', slips into attempting to refute Gödel's theorem. Actually, Wittgenstein could have used Gödel's theorem to good effect, to support his view that proof, and even truth, are 'family resemblance' concepts. The reason that Wittgenstein did not see all this is that Gödel's theorem had become an icon of mathematical realism, and he was blinded by his own ideology. The essay is a reply to Juliet Floyd's (...) work on Gödel: what she says Wittgenstein said, I say he should have said, but didn't (couldn't). (shrink)

The relationship between Albert Einstein’s special theory of relativity and Hendrik A. Lorentz’s ether theory is best understood in terms of competing interpretations of Lorentz invariance. In the 1890s, Lorentz proved and exploited the Lorentz invariance of Maxwell’s equations, the laws governing electromagnetic fields in the ether, with what he called the theorem of corresponding states. To account for the negative results of attempts to detect the earth’s motion through the ether, Lorentz, in effect, had to assume that (...) the laws governing the matter interacting with the fields are Lorentz invariant as well. This additional assumption can be seen as a generalization of the well-known contraction hypothesis. In Lorentz’s theory, it remained an unexplained coincidence that both the laws governing fields and the laws governing matter should be Lorentz invariant. In special relativity, by contrast, the Lorentz invariance of all physical laws directly reflects the Minkowski space-time structure posited by the theory. One can use this observation to produce a common-cause argument to show that the relativistic interpretation of Lorentz invariance is preferable to Lorentz’s interpretation. (shrink)

We study the proof-theoretic strength and effective content of the infinite form of Ramsey's theorem for pairs. Let RT n k denote Ramsey's theorem for k-colorings of n-element sets, and let RT $^n_{ denote (∀ k)RT n k . Our main result on computability is: For any n ≥ 2 and any computable (recursive) k-coloring of the n-element sets of natural numbers, there is an infinite homogeneous set X with X'' ≤ T 0 (n) . Let IΣ n (...) and BΣ n denote the Σ n induction and bounding schemes, respectively. Adapting the case n = 2 of the above result (where X is low 2 ) to models of arithmetic enables us to show that RCA 0 + IΣ 2 + RT 2 2 is conservative over RCA 0 + IΣ 2 for Π 1 1 statements and that $RCA_0 + I\Sigma_3 + RT^2_{ , is Π 1 1 -conservative over RCA 0 + IΣ 3 . It follows that RCA 0 + RT 2 2 does not imply BΣ 3 . In contrast, J. Hirst showed that $RCA_0 + RT^2_{ does imply BΣ 3 , and we include a proof of a slightly strengthened version of this result. It follows that $RT^2_{ is strictly stronger than RT 2 2 over RCA 0. (shrink)

We develop some ideas about gauge symmetry in the context of Maxwell’s theory of electromagnetism in the Hamiltonian formalism. One great benefit of this formalism is that it pairs momentum and configurational degrees of freedom, so that a decomposition of one side into subsets can be translated into a decomposition of the other. In the case of electromagnetism, this enables us to pair degrees of freedom of the electric field with degrees of freedom of the vector potential. Another benefit (...) is that the formalism algorithmically identifies subsets of the equations of motion that represent time-dependent symmetries. For electromagnetism, these two benefits allow us to define gauge-fixing in parallel to special decompositions of the electric field. More specifically, we apply the Helmholtz decomposition theorem to split the electric field into its Coulombic and radiative parts, and show how this gives a special role to the Coulomb gauge (i.e. div \((\mathbf{A}) = 0\) ). We relate this argument to Maudlin’s (Entropy, 2018. https://doi.org/10.3390/e20060465 ) discussion, which advocated the Coulomb gauge. (shrink)

The ``doctrinal paradox'' or ``discursive dilemma'' shows that propositionwise majority voting over the judgments held by multiple individuals on some interconnected propositions can lead to inconsistent collective judgments on these propositions. List and Pettit (2002) have proved that this paradox illustrates a more general impossibility theorem showing that there exists no aggregation procedure that generally produces consistent collective judgments and satisfies certain minimal conditions. Although the paradox and the theorem concern the aggregation of judgments rather than preferences, they (...) invite comparison with two established results on the aggregation of preferences: the Condorcet paradox and Arrow's impossibility theorem. We may ask whether the new impossibility theorem is a special case of Arrow's theorem, or whether there are interesting disanalogies between the two results. In this paper, we compare the two theorems, and show that they are not straightforward corollaries of each other. We further suggest that, while the framework of preference aggregation can be mapped into the framework of judgment aggregation, there exists no obvious reverse mapping. Finally, we address one particular minimal condition that is used in both theorems – an independence condition – and suggest that this condition points towards a unifying property underlying both impossibility results. (shrink)

Martin’s conjecture is an attempt to classify the behavior of all definable functions on the Turing degrees under strong set theoretic hypotheses. Very roughly it says that every such function is either eventually constant, eventually equal to the identity function or eventually equal to a transfinite iterate of the Turing jump. It is typically divided into two parts: the first part states that every function is either eventually constant or eventually above the identity function and the second part states that (...) every function which is above the identity is eventually equal to a transfinite iterate of the jump. If true, it would provide an explanation for the unique role of the Turing jump in computability theory and rule out many types of constructions on the Turing degrees.In this thesis, we will introduce a few tools which we use to prove several cases of Martin’s conjecture. It turns out that both these tools and these results on Martin’s conjecture have some interesting consequences both for Martin’s conjecture and for a few related topics.The main tool that we introduce is a basis theorem for perfect sets, improving a theorem due to Groszek and Slaman. We also introduce a general framework for proving certain special cases of Martin’s conjecture which unifies a few pre-existing proofs. We will use these tools to prove three main results about Martin’s conjecture: that it holds for regressive functions on the hyperarithmetic degrees, that part 1 holds for order preserving functions on the Turing degrees, and that part 1 holds for a class of functions that we introduce, called measure preserving functions.This last result has several interesting consequences for the study of Martin’s conjecture. In particular, it shows that part 1 of Martin’s conjecture is equivalent to a statement about the Rudin-Keisler order on ultrafilters on the Turing degrees. This suggests several possible strategies for working on part 1 of Martin’s conjecture, which we will discuss.The basis theorem that we use to prove these results also has some applications outside of Martin’s conjecture. We will use it to prove a few theorems related to Sacks’ question about whether it is provable in $\mathsf {ZFC}$ that every locally countable partial order of size continuum embeds into the Turing degrees. We will show that in a certain extension of $\mathsf {ZF}$, this holds for all partial orders of height two, but not for all partial orders of height three. Our proof also yields an analogous result for Borel partial orders and Borel embeddings in $\mathsf {ZF}$, which shows that the Borel version of Sacks’ question has a negative answer.We will end the thesis with a list of open questions related to Martin’s conjecture, which we hope will stimulate further research.prepared by Patrick Lutz.E-mail: [email protected]. (shrink)

In the context of a weak formal theory called Basic Intuitionistic Mathematics $$\textsf{BIM}$$ BIM, we study Brouwer’s Fan Theorem and a strong negation of the Fan Theorem, Kleene’s Alternative (to the Fan Theorem). We prove that the Fan Theorem is equivalent to contrapositions of a number of intuitionistically accepted axioms of countable choice and that Kleene’s Alternative is equivalent to strong negations of these statements. We discuss finite and infinite games and introduce a constructively useful notion (...) of determinacy. We prove that the Fan Theorem is equivalent to the Intuitionistic Determinacy Theorem. This theorem says that every subset of Cantor space $$2^\omega $$ 2 ω is, in our constructively meaningful sense, determinate. Kleene’s Alternative is equivalent to a strong negation of a special case of this theorem. We also consider a uniform intermediate value theorem and a compactness theorem for classical propositional logic. The Fan Theorem is equivalent to each of these theorems and Kleene’s Alternative is equivalent to strong negations of them. We end with a note on ‘stronger’ Fan Theorems. The paper is a sequel to Veldman (Arch Math Logic 53:621–693, 2014). (shrink)

The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in out- line why Putnam’s result, and likewise the more restricted result we call the Multiple- Computations Theorem, are in fact theorems of statistical mechanics. We show why the mere interaction of a computing system with its environment cannot single out a computation as the preferred one amongst the many computations implemented by the system. We explain why (...) nonreductive approaches to solving the multiple- computations problem, and in particular why computational externalism, are dualistic in the sense that they imply that nonphysical facts in the environment of a computing system single out the computation. We discuss certain attempts to dissolve Putnam’s unrestricted result by appealing to systems with certain kinds of input and output states as a special case of computational externalism, and show why this approach is not workable without collapsing to behaviorism. We conclude with some remarks about the nonphysical nature of mainstream approaches to both statistical mechanics and the quantum theory of measurement with respect to the singling out of partitions and observables. (shrink)

In the topological semantics for modal logic, S4 is well known to be complete for the rational line and for the real line: these are special cases of S4’s completeness for any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete but strongly complete, for the rational line. But no similarly easy amendment is available for the real line. In an earlier paper, we proved a general (...) class='Hi'>theorem: S4 is strongly complete for any dense-in-itself metric space. Strong completeness for the real line is a special case. In the current paper, we give a proof of strong completeness tailored to the special case of the real line: the current proof is simpler and more accessible than the proof of the more general result and involves slightly different techniques. We proceed in two steps: first, we show that S4 is strongly complete for the space of finite and infinite binary sequences, equipped with a natural topology; and then we show that there is an interior map from the real line onto this space. (shrink)

ArgumentIn theAlmagest, Ptolemy finds that the apogee of Mercury moves progressively at a speed equal to his value for the rate of precession, namely one degree per century, in the tropical reference system of the ecliptic coordinates. He generalizes this to the other planets, so that the motions of the apogees of all five planets are assumed to be equal, while the solar apsidal line is taken to be fixed. In medieval Islamic astronomy, one change in this general proposition took (...) place because of the discovery of the motion of the solar apogee in the ninth century, which gave rise to lengthy discussions on the speed of its motion. Initially Bīrūnī and later Ibn al-Zarqālluh assigned a proper motion to it, although at different rates. Nevertheless, appealing to the Ptolemaic generalization and interpreting it as a methodological axiom, the dominant idea became to extend it in order to include the motion of the solar apogee as well. Another change occurred after correctly making a distinction between the motion of the apogees and the rate of precession. Some Western Islamic astronomers generalized Ibn al-Zarqālluh's proper motion of the solar apogee to the apogees of the planets. Analogously, Ibn al-Shāṭir maintained that the motion of the apogees is faster than precession. Nevertheless, the Ptolemaic generalization in the case of the equality of the motions of the apogees remained untouchable, despite the notable development of planetary astronomy, in both theoretical and observational aspects, in the late Islamic period. (shrink)

There is “something more” to money, as this incisive review shows. The target article's shortcoming is its overextension of the “drug” metaphor as a blend of features that do not fit the rationalistic economics and behavioral psychologies summarized as tool theories, but this may be resolved by viewing money as a particular case of the more general evolutionary phenomenon of emergent subsystem autonomy. (Published Online April 5 2006).

ABSTRACT In this paper we study consequence relations on the set of many sided sequents over a propositional language. We deal with the consequence relations axiomatized by the sequent calculi defined in [2] and associated with arbitrary finite algebras. These consequence relations are examples of what we call Gentzen systems. We define a semantics for these systems and prove a Strong Completeness Theorem, which is an extension of the Completeness Theorem for provable sequents stated in [2]. For the (...) special case of the finite linear MV-algebras, the Strong Completeness Theorem was proved in [10], as a consequence of McNaughton's Theorem. The main tool to prove this result for arbitrary algebras is the deduction-detachment theorem for Gentzen systems. (shrink)

Correlations of spins in a system of entangled particles are inconsistent with Kolmogorov’s probability theory (KPT), provided the system is assumed to be non-contextual. In the Alice–Bob EPR paradigm, non-contextuality means that the identity of Alice’s spin (i.e., the probability space on which it is defined as a random variable) is determined only by the axis $\alpha _{i}$ chosen by Alice, irrespective of Bob’s axis $\beta _{j}$ (and vice versa). Here, we study contextual KPT models, with two properties: (1) Alice’s (...) and Bob’s spins are identified as $A_{ij}$ and $B_{ij}$ , even though their distributions are determined by, respectively, $\alpha _{i}$ alone and $\beta _{j}$ alone, in accordance with the no-signaling requirement; and (2) the joint distributions of the spins $A_{ij},B_{ij}$ across all values of $\alpha _{i},\beta _{j}$ are constrained by fixing distributions of some subsets thereof. Of special interest among these subsets is the set of probabilistic connections, defined as the pairs $\left( A_{ij},A_{ij'}\right) $ and $\left( B_{ij},B_{i'j}\right) $ with $\alpha _{i}\not =\alpha _{i'}$ and $\beta _{j}\not =\beta _{j'}$ (the non-contextuality assumption is obtained as a special case of connections, with zero probabilities of $A_{ij}\not =A_{ij'}$ and $B_{ij}\not =B_{i'j}$ ). Thus, one can achieve a complete KPT characterization of the Bell-type inequalities, or Tsirelson’s inequalities, by specifying the distributions of probabilistic connections compatible with those and only those spin pairs $\left( A_{ij},B_{ij}\right) $ that are subject to these inequalities. We show, however, that quantum-mechanical (QM) constraints are special. No-forcing theorem says that if a set of probabilistic connections is not compatible with correlations violating QM, then it is compatible only with the classical–mechanical correlations. No-matching theorem says that there are no subsets of the spin variables $A_{ij},B_{ij}$ whose distributions can be fixed to be compatible with and only with QM-compliant correlations. (shrink)

We examine the reverse mathematical strength of a variation of Hindman’s Theorem (HT) constructed by essentially combining HT with the Thin Set Theorem to obtain a principle that we call thin-HT. This principle states that every coloring c:N→N has an infinite set S⊆N whose finite sums are thin for c, meaning that there is an i with c(s)≠i for all nonempty sums s of finitely many distinct elements of S. We show that there is a computable instance of (...) thin-HT such that every solution computes ∅′, as is the case with HT, as shown by Blass, Hirst, and Simpson (1987). In analyzing this proof, we deduce that thin-HT implies ACA0 over RCA0+IΣ20. On the other hand, using Rumyantsev and Shen’s computable version of the Lovász Local Lemma, we show that there is a computable instance of the restriction of thin-HT to sums of exactly 2 elements such that any solution has diagonally noncomputable degree relative to ∅′. Hence there is a computable instance of this restriction of thin-HT with no Σ20 solution. (shrink)

Gentzen writes in the published version of his doctoral thesis Untersuchungen über das logische Schliessen that he was able to prove the normalization theorem only for intuitionistic natural deduction, but not for classical. To cover the latter, he developed classical sequent calculus and proved a corresponding theorem, the famous cut elimination result. Its proof was organized so that a cut elimination result for an intuitionistic sequent calculus came out as a special case, namely the one in (...) which the sequents have at most one formula in the right, succedent part. Thus, there was no need for a direct proof of normalization for intuitionistic natural deduction. The only traces of such a proof in the published thesis are some convertibilities, such as when an implication introduction is followed by an implication elimination [1934–35, II.5.13]. It remained to Dag Prawitz in 1965 to work out a proof of normalization. Another, less known proof was given also in 1965 by Andres Raggio.We found in February 2005 an early handwritten version of Gentzen's thesis, with exactly the above title, but with rather different contents: Most remarkably, it contains a detailed proof of normalization for what became the standard system of natural deduction. The manuscript is located in the Paul Bernays collection at the ETH-Zurichwith the signum Hs. 974: 271. Bernays must have gotten it well before the time of his being expelled from Göttingen on the basis of the racial laws in April 1933. (shrink)

Guided by the example of gauge transformations associated with classical Yang-Mills fields, a very general class of transformations is considered. The explicit representation of these transformations involves not only the independent and the dependent field variables, but also a set of position-dependent parameters together with their first derivatives. The stipulation that an action integral associated with the field variables be invariant under such transformations gives rise to a set of three conditions involving the Lagrangian and its derivatives, together with derivatives (...) of the functions that define the transformations. These invariance identities constitute an extension of the classical theorem of Noether to general transformations of this kind. An application to the case of gauge fields demonstrates the existence of two distinct types of conservation laws for such fields. (shrink)

This article presents qualitative interview data to explore the health-related carework of low-income women caregivers with special-needs children and the implications of carework for women’s financial security. The author documents “direct” and “advocacy” carework as two types of caregiving that low-income women carry out in the context of declining government resources for poor disabled children. The author shows that the unique demands of carework responsibilities and the conditions of low-wage work combine to limit caregivers’ employment and education options as (...) well as their long-term prospects for financial stability. (shrink)

How can the propositional attitudes of several individuals be aggregated into overall collective propositional attitudes? Although there are large bodies of work on the aggregation of various special kinds of propositional attitudes, such as preferences, judgments, probabilities and utilities, the aggregation of propositional attitudes is seldom studied in full generality. In this paper, we seek to contribute to filling this gap in the literature. We sketch the ingredients of a general theory of propositional attitude aggregation and prove two new (...) theorems. Our first theorem simultaneously characterizes some prominent aggregation rules in the cases of probability, judgment and preference aggregation, including linear opinion pooling and Arrovian dictatorships. Our second theorem abstracts even further from the specific kinds of attitudes in question and describes the properties of a large class of aggregation rules applicable to a variety of belief-like attitudes. Our approach integrates some previously disconnected areas of investigation. (shrink)

Quantified hybrid logic is quantified modal logic extended with apparatus for naming states and asserting that a formula is true at a named state. While interpolation and Beth's definability theorem fail in a number of well-known quantified modal logics , their counterparts in quantified hybrid logic have these properties. These are special cases of the main result of the paper: the quantified hybrid logic of any class of frames definable in the bounded fragment of first-order logic has the (...) interpolation property, irrespective of whether varying, constant, expanding, or contracting domains are assumed. (shrink)

Wilkie 5 397) proved a “theorem of the complement” which implies that in order to establish the o-minimality of an expansion of with C∞ functions it suffices to obtain uniform bounds on the number of connected components of quantifier free definable sets. He deduced that any expansion of with a family of Pfaffian functions is o-minimal. We prove an effective version of Wilkie's theorem of the complement, so in particular given an expansion of the ordered field with finitely (...) many C∞ functions, if there are uniform and computable upper bounds on the number of connected components of quantifier free definable sets, then there are uniform and computable bounds for all definable sets. In such a case the theory of the structure is effectively o-minimal: there is a recursively axiomatized subtheory such that each of its models is o-minimal. This implies the effective o-minimality of any expansion of with Pfaffian functions. We apply our results to the open problem of the decidability of the theory of the real field with the exponential function. We show that the decidability is implied by a positive answer to the following problem ): given a language L expanding the language of ordered rings, if an L-sentence is true in every L-structure expanding the ordered field of real numbers, then it is true in every o-minimal L-structure expanding any real closed field. (shrink)

On the intended interpretation of intuitionistic logic, Heyting's Proof Interpretation, a proof of a proposition of the form p -> q consists in a construction method that transforms any possible proof of p into a proof of q. This involves the notion of the totality of all proofs in an essential way, and this interpretation has therefore been objected to on grounds of impredicativity (e.g. Gödel 1933). In fact this hardly ever leads to problems as in proofs of implications usually (...) nothing more is assumed about a proof of the antecedent than that it indeed is one, and this assumption does not require a further grasp of the totality of proofs. The prime example of an intuitionistic theorem that goes beyond that assumption is Brouwer's proof of the 'bar theorem': For every tree x, if x contains a decidable subset of nodes such that every path through the tree meets it (a 'bar'), then there is a well-ordered subtree of x that contains a bar for the whole of x. Instantiated with an arbitrary tree t, this proposition takes the form P(t) -> Q(t). Brouwer's proof of the bar theorem mainly consists in an analysis of the inner structure that a proof of P(t) must have, where proofs are taken to be primarily mental objects. So here Brouwer engages in phenomenological reflection by considering the acts in which we think about bars. From that analysis he obtains the information from which to construct a proof of Q(t). In this talk I will argue that Brouwer circumvents the problem of impredicativity by resorting to a transcendental argument based on phenomenological description, and defend this application by showing how common objections to transcendental arguments do not apply here. Finally, I will indulge in some historical speculation by relating the foregoing considerations to the remarkable change that Gödel's view on the Proof Interpretation underwent between his Yale Lecture (1941) and the Dialectica paper (1958). (shrink)

The energy-momentum tensor for a particular matter component summarises its local energy-momentum distribution in terms of densities and current densities. We re-investigate under what conditions these local distributions can be integrated to meaningful global quantities. This leads us directly to a classic theorem by Max von Laue concerning integrals of components of the energy-momentum tensor, whose statement and proof we recall. In the first half of this paper we do this within the realm of Special Relativity and in (...) the traditional mathematical language using components with respect to affine charts, thereby focusing on the intended physical content and interpretation. In the second half we show how to do all this in a proper differential-geometric fashion and on arbitrary space-time manifolds, this time focusing on the group-theoretic and geometric hypotheses underlying these results. Based on this we give a proper geometric statement and proof of Laue's theorem, which is shown to generalise from Minkowski space to space-times with significantly less symmetries. This result, which seems to be new, not only generalises but also clarifies the geometric content and hypotheses of Laue's theorem. A series of three appendices lists our conventions and notation and summarises some of the conceptual and mathematical background needed in the main text. (shrink)

Testing the validity of knowledge requires formal expression of that knowledge. Formality of an expression is defined as the invariance, under changes of context, of the expression's meaning, i.e. the distinction which the expression represents. This encompasses both mathematical formalism and operational determination. The main advantages of formal expression are storability, universal communicability, and testability. They provide a selective edge in the Darwinian competition between ideas. However, formality can never be complete, as the context cannot be eliminated. Primitive terms, observation (...) set-ups, and background conditions are inescapable parts of formal or operational definitions, that all refer to a context beyond the formal system. Heisenberg's Uncertainty Principle and Gödel's Theorem provide special cases of this more universal limitation principle. Context-dependent expressions, on the other hand, have the benefit of being more flexible, intuitive and direct, and putting less strain on memory. It is concluded that formality is not an absolute property, but a context-dependent one: different people will apply different amounts of formality in different situations or for different purposes. Some recent computational and empirical studies of formality and contexts illustrate the emerging scientific investigation of this dependence. (shrink)

Many mathematicians have cited depth as an important value in their research. However, there is no single widely accepted account of mathematical depth. This article is an attempt to bridge this gap. The strategy is to begin with a discussion of Szemerédi's theorem, which says that each subset of the natural numbers that is sufficiently dense contains an arithmetical progression of arbitrary length. This theorem has been judged deep by many mathematicians, and so makes for a good (...) class='Hi'>case on which to focus in analyzing mathematical depth. After introducing the theorem, four accounts of mathematical depth will be considered. (shrink)

Easy to understand philosophy papers in all areas. Table of contents: Three Short Philosophy Papers on Human Freedom The Paradox of Religions Institutions Different Perspectives on Religious Belief: O’Reilly v. Dawkins. v. James v. Clifford Schopenhauer on Suicide Schopenhauer’s Fractal Conception of Reality Theodore Roszak’s Views on Bicameral Consciousness Philosophy Exam Questions and Answers Locke, Aristotle and Kant on Virtue Logic Lecture for Erika Kant’s Ethics Van Cleve on Epistemic Circularity Plato’s Theory of Forms Can we trust our senses? Yes (...) we can Descartes on What He Believes Himself to Be The Role of Values in Science Modern Science Kant’s Moral Philosophy Plato’s Republic as Pol Potist Bureaucracy Schopenhauer on Human Suffering Bertrand Russell on the Value of Philosophy The Philosophical Value of Uncertainty Logic Homework: Theorems and Models Searle vs. Turing on the Imitation Game Hume, Frankfurt, and Holbach on Personal Freedom Manifesto of the University of Wisconsin, Madison Secular Society Michael’s Analysis of the Limits of Civil Protections Bentham and Mill on Different Types of Pleasure Set Theory Homework Aristotle on Virtue Nagel On the Hard Problem Wittgenstein on Language and Thought Camus and Schopenhauer on the Meaning of Life Camus’ Hero as Rebel without a Cause My Little Finger: Camus’ Absurdism Illustrated Are Late-term Abortions Ethical? Does Mathematics Assume the Truth of Platonism? The Self-defeating Nature of Utilitarianism and Consequentialism Generally What is The Good Life? Bentham and Mill regarding types of pleasures Kant’s Moral Philosophy Five Short Papers on Mind-body Dualism Tracy Latimer’s Father had the Right to Kill Her: Towards a doctrine of generalized self-defense Arguments Concerning God and Morality Goldman, Rousseau and von Hayek on the Ideal State J.S Mill on Liberty and Personal Freedom A Kantian Analysis of a Borderline Date-rape Situation Living Well as Flourishing: Aristotle’s Conception of the Good Life Three Essays on Medical Ethics: Answers to Exam Questions on Elective Amputation, Vaccination, and Informed Consent Hobbes, Marx, Rousseau, Nietzsche: Their Central Themes De Tocqueville on Egoism Mill vs. Hobbes on Liberty Exam-Essays on the Moral Systems of Mill, Bentham, and Kant Kant’s Moral System Aristotle on Virtue Plato’s Cave Allegory An Ethical Quandary Superorganisms The Tuskegee Experiment A Rawlsian Analysis Why Moore’s Proof of an External World Fails A Defense of Nagel’s Argument Against Materialism A Utilitarian Analysis of a Case of Theft The Paradox of the Self-aware Wretch: An Analysis of Pascal’s Moral Philosophy Jean-Paul Sartre: Decline and Fall of a Marxist Sell-out A One Page Proof of Plato’s Theory of Forms Plato’s Republic as Pol Potist Bureaucracy The problem of the one and the many Four Short Essays on Truth and Knowledge What is ‘the Good Life?’ The Ontological Argument Different Political Philosophies: Plato, Locke, Madison, Rousseau, Hayek, and Mill on the State What do I know with certainty? Skepticism about skepticism Neuroscience and Freewill Operant Conditioning What makes us special? Are Late-term Abortions Ethical? No Two Papers on Epistemology: Gettier and Bostrom Examination Nietzsche on Punishment God’s Foreknowledge and Moral Responsibility . (shrink)

L. J. Savage and I. J. Good have each demonstrated that the expected utility of free information is never negative for a decision maker who updates her degrees of belief by conditionalization on propositions learned for certain. In this paper Good's argument is generalized to show the same result for a decision maker who updates her degrees of belief on the basis of uncertain information by Richard Jeffrey's probability kinematics. The Savage/Good result is shown to be a special (...) class='Hi'>case of the more general result. (shrink)

Lajevardi and Salehi, in “There may be many arithmetical Gödel sentences”, argue against the use of the definite article in the expression “the Gödel sentence”, by claiming that any unsound theory has Gödelian sentences with different truth values. We show that their Theorems 1 and 2 are special cases (modulo Löb's theorem and the first incompleteness theorem) of general observations pertaining to fixed points of any formula, and argue that the false sentences of Lajevardi and Salehi are (...) in fact not Gödel sentences. (shrink)

In his pioneering work in the field of inductive inference, Gold (Inf Control 10:447–474, 1967) proved that a set containing all finite languages and at least one infinite language over the same fixed alphabet is not identifiable in the limit (learnable in the exact sense) from complete texts. Gold’s work paved the way for computational learning theories of language and has implications for two linguistically relevant classes in the Chomsky hierarchy (cf. Chomsky in Inf Control 2:137–167, 1959, Chomsky in Knowledge (...) of language: its nature, origin, and use, Praeger, 1986; Shieber in Linguist Philos 8:333–343, 1985; Heinz in Linguist Inq 41:623–661, 2010). Within that same framework, Angluin (Inf Control 45:117–135, 1980) provided a complete characterization for the learnability of language families. Mathematically, the concept of identification in the limit from that classical setting can be seen as the use of a particular type of metric for learning in the limit (Wharton in Inf Control 26:236–255, 1974). In this research note, I use Niyogi’s extended version of a theorem by Blum and Blum (Inf Control 28:125–155, 1975) on the existence of locking data sets to prove a necessary condition for learnability in the limit of any family of languages with the Gold property in any given metric. This recovers the most general version of Gold’s Theorem as a particular case. Moreover, when the language family is further assumed to contain all finite languages, the same condition also becomes sufficient for learnability in the limit. Finally, we discuss questions that are left open and outline a research program regarding language learnability in the limit from other input types and cognitive feasibility. (shrink)

We present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our (...) proof to a special class of circular definitions as well as to the first-order case. (shrink)

In this article, we investigate the status of the homomorphism preservation property amongst restricted classes of finite relational structures and algebraic structures. We show that there are many homomorphism-closed classes of finite lattices that are definable by a first-order sentence but not by existential positive sentences, demonstrating the failure of the homomorphism preservation property for lattices at the finite level. In contrast to the negative results for algebras, we establish a finite-level relativised homomorphism preservation theorem in the relational (...) class='Hi'>case. More specifically, we give a complete finite-level characterisation of first-order definable finitely generated anti-varieties relative to classes of relational structures definable by sentences of some general forms. When relativisation is dropped, this gives a fresh proof of Atserias’s characterisation of first-order definable constraint satisfaction problems over a fixed template, a well known special case of Rossman’s Finite Homomorphism Preservation Theorem. (shrink)

We give a uniform proof of the theorems of Yao and Beigel–Tarui representing ACC predicates as constant depth circuits with MODm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {MOD}_{m}$$\end{document} gates and a symmetric gate. The proof is based on a relativized, generalized form of Toda’s theorem expressed in terms of closure properties of formulas under bounded universal, existential and modular counting quantifiers. This allows the main proofs to be expressed in terms of formula classes instead of Boolean (...) circuits. The uniform version of the Beigel–Tarui theorem is then obtained automatically via the Furst–Saxe–Sipser and Paris–Wilkie translations. As a special case, we obtain a uniform version of Razborov and Smolensky’s representation of AC0[p]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {AC}^{0}[p]$$\end{document} circuits. The paper is partly expository, but is also motivated by the desire to recast Toda’s theorem, the Beigel–Tarui theorem, and their proofs into the language of bounded arithmetic. However, no knowledge of bounded arithmetic is needed. (shrink)

De Finetti's representation theorem is a special case of the ergodic decomposition of stationary probability measures. The problems of the interpretation of probabilities centred around de Finetti's theorem are extended to this more general situation. The ergodic decomposition theorem has a physical background in the ergodic theory of dynamical systems. Thereby the interpretations of probabilities in the cases of de Finetti's theorem and its generalization and in ergodic theory are systematically connected to each other.