Results for 'Malament’s theorem'

999 found
Order:
  1.  87
    Against Particle/Field Duality: Asymptotic Particle States and Interpolating Fields in Interacting Qft (Or: Who's Afraid of Haag's Theorem?). [REVIEW]Jonathan Bain - 2000 - Erkenntnis 53 (3):375-406.
    This essay touches on a number of topics in philosophy of quantum field theory from the point of view of the LSZ asymptotic approach to scattering theory. First, particle/field duality is seen to be a property of free field theory and not of interacting QFT. Second, it is demonstrated how LSZ side-steps the implications of Haag's theorem. Finally, a recent argument due to Redhead, Malament and Arageorgis against the concept of localized particle states is addressed. Briefly, the argument observes (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  2.  34
    Simultaneity as an Invariant Equivalence Relation.Marco Mamone-Capria - 2012 - Foundations of Physics 42 (11):1365-1383.
    This paper deals with the concept of simultaneity in classical and relativistic physics as construed in terms of group-invariant equivalence relations. A full examination of Newton, Galilei and Poincaré invariant equivalence relations in ℝ4 is presented, which provides alternative proofs, additions and occasionally corrections of results in the literature, including Malament’s theorem and some of its variants. It is argued that the interpretation of simultaneity as an invariant equivalence relation, although interesting for its own sake, does not cut (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  89
    Lessons of Bell's Theorem: Nonlocality, Yes; Action at a Distance, Not Necessarily.Wayne C. Myrvold - 2016 - In Shan Gao Mary Bell (ed.), Quantum Nonlocality and Reality: 50 Years of Bell's Theorem. Cambridge: Cambridge University Press. pp. 238-260.
    Fifty years after the publication of Bell's theorem, there remains some controversy regarding what the theorem is telling us about quantum mechanics, and what the experimental violations of Bell inequalities are telling us about the world. This chapter represents my best attempt to be clear about what I think the lessons are. In brief: there is some sort of nonlocality inherent in any quantum theory, and, moreover, in any theory that reproduces, even approximately, the quantum probabilities for the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Arrow's Theorem in Judgment Aggregation.Franz Dietrich & Christian List - 2007 - Social Choice and Welfare 29 (1):19-33.
    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 (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   66 citations  
  5. On the Strength of Ramsey's Theorem for Pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
    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 (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   36 citations  
  6. Non-Separability Does Not Relieve the Problem of Bell’s Theorem.Joe Henson - 2013 - Foundations of Physics 43 (8):1008-1038.
    This paper addresses arguments that “separability” is an assumption of Bell’s theorem, and that abandoning this assumption in our interpretation of quantum mechanics (a position sometimes referred to as “holism”) will allow us to restore a satisfying locality principle. Separability here means that all events associated to the union of some set of disjoint regions are combinations of events associated to each region taken separately.In this article, it is shown that: (a) localised events can be consistently defined without implying (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  7. Van Lambalgen's Theorem and High Degrees.Johanna N. Y. Franklin & Frank Stephan - 2011 - Notre Dame Journal of Formal Logic 52 (2):173-185.
    We show that van Lambalgen's Theorem fails with respect to recursive randomness and Schnorr randomness for some real in every high degree and provide a full characterization of the Turing degrees for which van Lambalgen's Theorem can fail with respect to Kurtz randomness. However, we also show that there is a recursively random real that is not Martin-Löf random for which van Lambalgen's Theorem holds with respect to recursive randomness.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Bell’s Theorem: Two Neglected Solutions.Louis Vervoort - 2013 - Foundations of Physics 43 (6):769-791.
    Bell’s theorem admits several interpretations or ‘solutions’, the standard interpretation being ‘indeterminism’, a next one ‘nonlocality’. In this article two further solutions are investigated, termed here ‘superdeterminism’ and ‘supercorrelation’. The former is especially interesting for philosophical reasons, if only because it is always rejected on the basis of extra-physical arguments. The latter, supercorrelation, will be studied here by investigating model systems that can mimic it, namely spin lattices. It is shown that in these systems the Bell inequality can be (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  9. Composition as Identity and Plural Cantor's Theorem.Einar Duenger Bohn - 2016 - Logic and Logical Philosophy 25 (3).
    I argue that Composition as Identity blocks the plural version of Cantor's Theorem, and that therefore the plural version of Cantor's Theorem can no longer be uncritically appealed to. As an example, I show how this result blocks a recent argument by Hawthorne and Uzquiano.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  3
    Ehrenfest’s Theorem Revisited.Henryk Stanisław Arodź - 2019 - Philosophical Problems in Science 66:73-94.
    Historically, Ehrenfest’s theorem is the first one which shows that classical physics can emerge from quantum physics as a kind of approximation. We recall the theorem in its original form, and we highlight its generalizations to the relativistic Dirac particle and to a particle with spin and izospin. We argue that apparent classicality of the macroscopic world can probably be explained within the framework of standard quantum mechanics.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  14
    Frege's Theorem in Plural Logic.Simon Hewitt - manuscript
    A version of Frege's theorem can be proved in a plural logic with pair abstraction. We talk through this and discuss the philosophical implications of the result.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  12. Frege's Basic Law V and Cantor's Theorem.Manuel Bremer - manuscript
    The following essay reconsiders the ontological and logical issues around Frege’s Basic Law (V). If focuses less on Russell’s Paradox, as most treatments of Frege’s Grundgesetze der Arithmetik (GGA)1 do, but rather on the relation between Frege’s Basic Law (V) and Cantor’s Theorem (CT). So for the most part the inconsistency of Naïve Comprehension (in the context of standard Second Order Logic) will not concern us, but rather the ontological issues central to the conflict between (BLV) and (CT). These (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  47
    Bell’s Theorem and the Issue of Determinism and Indeterminism.Michael Esfeld - 2015 - Foundations of Physics 45 (5):471-482.
    The paper considers the claim that quantum theories with a deterministic dynamics of objects in ordinary space-time, such as Bohmian mechanics, contradict the assumption that the measurement settings can be freely chosen in the EPR experiment. That assumption is one of the premises of Bell’s theorem. I first argue that only a premise to the effect that what determines the choice of the measurement settings is independent of what determines the past state of the measured system is needed for (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  83
    A Conditional Defense of Plurality Rule: Generalizing May's Theorem in a Restricted Informational Environment.Robert E. Goodin & Christian List - 2006 - American Journal of Political Science 50 (4):940-949.
    May's theorem famously shows that, in social decisions between two options, simple majority rule uniquely satisfies four appealing conditions. Although this result is often cited in support of majority rule, it has never been extended beyond decisions based on pairwise comparisons of options. We generalize May's theorem to many-option decisions where voters each cast one vote. Surprisingly, plurality rule uniquely satisfies May's conditions. This suggests a conditional defense of plurality rule: If a society's balloting procedure collects only a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  15.  33
    Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
    This paper addresses the strength of Ramsey's theorem for pairs ($RT^2_2$) over a weak base theory from the perspective of 'proof mining'. Let $RT^{2-}_2$ denote Ramsey's theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König's Lemma and a substantial amount of $\Sigma^0_1$-induction (enough to prove the totality of all primitive recursive functions but not of all primitive recursive functionals). (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16. Craig's Theorem and the Empirical Underdetermination Thesis Reassessed.Christian List - 1999 - Disputatio 1 (7):27-39.
    This paper reassesses the question of whether Craig’s theorem poses a challenge to Quine's empirical underdetermination thesis. It will be demonstrated that Quine’s account of this issue in his paper “Empirically Equivalent Systems of the World” (1975) is flawed and that Quine makes too strong a concession to the Craigian challenge. It will further be pointed out that Craig’s theorem would threaten the empirical underdetermination thesis only if the set of all relevant observation conditionals could be shown to (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  17. Erratum to “The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories” Logic Journal of the IGPL, 16: 585–590. [REVIEW]Igor Oliveira & Walter Carnielli - 2009 - Logic Journal of the IGPL 17 (6):803-804.
    This note clarifies an error in the proof of the main theorem of “The Ricean Objection: An Analogue of Rice’s Theorem for First-Order Theories”, Logic Journal of the IGPL, 16(6): 585–590(2008).
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  25
    Tarski's Theorem and Liar-Like Paradoxes.Ming Hsiung - 2014 - Logic Journal of the IGPL 22 (1):24-38.
    Tarski's theorem essentially says that the Liar paradox is paradoxical in the minimal reflexive frame. We generalise this result to the Liar-like paradox $\lambda^\alpha$ for all ordinal $\alpha\geq 1$. The main result is that for any positive integer $n = 2^i(2j+1)$, the paradox $\lambda^n$ is paradoxical in a frame iff this frame contains at least a cycle the depth of which is not divisible by $2^{i+1}$; and for any ordinal $\alpha \geq \omega$, the paradox $\lambda^\alpha$ is paradoxical in a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19.  24
    On Modifications of Reichenbach's Principle of Common Cause in Light of Bell's Theorem.Eric G. Cavalcanti & Raymond Lal - 2014 - Journal of Physics A: Mathematical and Theoretical 47 (42):424018.
    Bellʼs 1964 theorem causes a severe problem for the notion that correlations require explanation, encapsulated in Reichenbachʼs principle of common cause. Despite being a hallmark of scientific thought, dropping the principle has been widely regarded as much less bitter medicine than the perceived alternative—dropping relativistic causality. Recently, however, some authors have proposed that modified forms of Reichenbachʼs principle could be maintained even with relativistic causality. Here we break down Reichenbachʼs principle into two independent assumptions—the principle of common cause proper (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  20.  32
    Prior’s Defence of Hintikka’s Theorem. A Discussion of Prior’s ‘The Logic of Obligation and the Obligations of the Logician’.Peter Øhrstrøm, Jörg Zeller & Ulrik Sandborg-Petersen - 2012 - Synthese 188 (3):449-454.
    In his paper, The logic of obligation and the obligations of the logician, A.N. Prior considers Hintikka's theorem, according to which a statement cannot be both impossible and permissible. This theorem has been seen as problematic for the very idea of a logic of obligation. However, Prior rejects the view that the logic of obligation cannot be formalised. He sees this resistance against such a view as an important part of what could be called the obligation of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  17
    Term Extraction and Ramsey's Theorem for Pairs.Alexander P. Kreuzer & Ulrich Kohlenbach - 2012 - Journal of Symbolic Logic 77 (3):853-895.
    In this paper we study with proof-theoretic methods the function(al) s provably recursive relative to Ramsey's theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functional provably recursive from $RCA_0 + COH + \Pi _1^0 - CP$ are primitive recursive. This also provides a uniform method to extract bounds from proofs that use these principles. As a consequence we obtain a new proof of the fact that $WKL_0 + \Pi _1^0 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22. Bell’s Theorem Without Inequalities and Without Unspeakable Information.Adán Cabello - 2005 - Foundations of Physics 35 (11):1927-1934.
    A proof of Bell’s theorem without inequalities is presented in which distant local setups do not need to be aligned, since the required perfect correlations are achieved for any local rotation of the local setups.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  17
    Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.
    The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are nonnull in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for nonnull many computable stable colorings and the sets that can compute infinite homogeneous sets for all computable stable colorings agree below $\emptyset'$ but (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  24
    On Gleason’s Theorem Without Gleason.David Buhagiar, Emmanuel Chetcuti & Anatolij Dvurečenskij - 2009 - Foundations of Physics 39 (6):550-558.
    The original proof of Gleason’s Theorem is very complicated and therefore, any result that can be derived also without the use of Gleason’s Theorem is welcome both in mathematics and mathematical physics. In this paper we reprove some known results that had originally been proved by the use of Gleason’s Theorem, e.g. that on the quantum logic ℒ(H) of all closed subspaces of a Hilbert space H, dim H≥3, there is no finitely additive state whose range is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25. An Inverse of Bell's Theorem.Kaj B. Hansen - 1995 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 26 (1):63 - 74.
    A class of probability functions is studied. This class contains the probability functions of half-spin particles and spinning classical objects. A notion of realisability for these functions is defined. In terms of this notion two versions of Bell's theorem and their inverses are stated and proved.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  56
    A Note on Introducing a 'Zero-Line' of Welfare as an Escape-Route From Arrow's Theorem.Christian List - 2001 - Pacific Economic Review (Special Section in Honour of Amartya Sen) 6 (2):223-238.
    Since Sen's insightful analysis of Arrow's Impossibility Theorem (Sen, 1970/1979), Arrow's theorem is often interpreted as a consequence of the exclusion of interpersonal information from Arrow's framework. Interpersonal comparability of either welfare levels or welfare units is known to be sufficient for circumventing Arrow's impossibility result (e.g. Sen, 1970/1979, 1982; Roberts, 1980; d'Aspremont, 1985). But it is less well known whether one of these types of comparability is also necessary or whether Arrow's conditions can already be satisfied in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  27.  17
    An Approximate Herbrand's Theorem and Definable Functions in Metric Structures.Isaac Goldbring - 2012 - Mathematical Logic Quarterly 58 (3):208-216.
    We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable functions in Hilbert spaces expanded by a group of generic unitary operators and Hilbert spaces expanded by a generic subspace. We also show how Herbrand's theorem can be used to characterize definable functions in absolutely ubiquitous structures from classical logic.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  12
    A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.
    We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several examples of colorings of the integers which do not have computable witnesses to Hindman's Theorem.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  37
    An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals.Kenshi Miyabe - 2010 - Notre Dame Journal of Formal Logic 51 (3):337-349.
    Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem by considering the join of infinitely many reals which are random relative to each other. In addition, we study computability of the reals in the range of Omega operators. It is known that $\Omega^{\phi'}$ is high. We extend this result to that $\Omega^{\phi^{(n)}}$ is $\textrm{high}_n$ . We also prove that there exists A such that, for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  27
    Kaplan’s Counterexample to Quine’s Theorem.Paolo Bonardi - 2018 - Grazer Philosophische Studien 95 (2):196-223.
    _ Source: _Page Count 28 In his article “Opacity”, David Kaplan propounded a counterexample to the thesis, defended by Quine and known as _Quine’s Theorem_, that establishes the illegitimacy of quantifying from outside into a position not open to substitution. He ingeniously built his counterexample using Quine’s own philosophical material and novel devices, _arc quotes_ and _$entences_. The present article offers detailed analysis and critical discussion of Kaplan’s counterexample and proposes a reasonable reformulation of Quine’s Theorem that bypasses both (...)
    No categories
    Direct download (5 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  31.  27
    Gleason's Theorem has a Constructive Proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
    Gleason's theorem for ³ says that if f is a nonnegative function on the unit sphere with the property that f(x) + f(y) + f(z) is a fixed constant for each triple x, y, z of mutually orthogonal unit vectors, then f is a quadratic form. We examine the issues raised by discussions in this journal regarding the possibility of a constructive proof of Gleason's theorem in light of the recent publication of such a proof.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  72
    Löb's Theorem as a Limitation on Mechanism.Michael Detlefsen - 2002 - Minds and Machines 12 (3):353-381.
    We argue that Löb's Theorem implies a limitation on mechanism. Specifically, we argue, via an application of a generalized version of Löb's Theorem, that any particular device known by an observer to be mechanical cannot be used as an epistemic authority (of a particular type) by that observer: either the belief-set of such an authority is not mechanizable or, if it is, there is no identifiable formal system of which the observer can know (or truly believe) it to (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  20
    Ramsey’s Theorem and König’s Lemma.T. E. Forster & J. K. Truss - 2007 - Archive for Mathematical Logic 46 (1):37-42.
    We consider the relation between versions of Ramsey’s Theorem and König’s Infinity Lemma, in the absence of the axiom of choice.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34. Self-Reference and Gödel's Theorem: A Husserlian Analysis. [REVIEW]Albert Johnstone - 2003 - Husserl Studies 19 (2):131-151.
    A Husserlian phenomenological approach to logic treats concepts in terms of their experiential meaning rather than in terms of reference, sets of individuals, and sentences. The present article applies such an approach in turn to the reasoning operative in various paradoxes: the simple Liar, the complex Liar paradoxes, the Grelling-type paradoxes, and Gödel’s Theorem. It finds that in each case a meaningless statement, one generated by circular definition, is treated as if were meaningful, and consequently as either true or (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  22
    An Intuitionistic Version of Cantor's Theorem.Dario Maguolo & Silvio Valentini - 1996 - Mathematical Logic Quarterly 42 (1):446-448.
    An intuitionistic version of Cantor's theorem, which shows that there is no surjective function from the type of the natural numbers N into the type N → N of the functions from N into N, is proved within Martin-Löf's Intuitionistic Type Theory with the universe of the small types.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  7
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory.F. Stephan & B. Borchert - 2000 - Mathematical Logic Quarterly 46 (4):489-504.
    Rice's Theorem says that every nontrivia semantic property of programs is undecidable. In this spirit we show the following: Every nontrivia absolute counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect analogue of Rice's Theorem.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  33
    Hechler’s Theorem for the Null Ideal.Maxim R. Burke & Masaru Kada - 2004 - Archive for Mathematical Logic 43 (5):703-722.
    We prove the following theorem: For a partially ordered set Q such that every countable subset of Q has a strict upper bound, there is a forcing notion satisfying the countable chain condition such that, in the forcing extension, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing. The corresponding theorem for the meager (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  40
    Hechler's Theorem for Tall Analytic P-Ideals.Barnabás Farkas - 2011 - Journal of Symbolic Logic 76 (2):729 - 736.
    We prove the following version of Hechler's classical theorem: For each partially ordered set (Q, ≤) with the property that every countable subset of Q has a strict upper bound in Q, there is a ccc forcing notion such that in the generic extension for each tall analytic P-ideal J (coded in the ground model) a cofinal subset of (J, ⊆*) is order isomorphic to (Q, ≤).
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  39. A Welfarist Version of Harsanyi's Theorem.Claude D'Aspremont & Philippe Mongin - 2008 - In M. Salles and J. Weymark M. Fleurbaey (ed.), Justice, Political Liberalism, and Utilitarianism. Cambridge University Press. pp. Ch. 11.
    This is a chapter of a collective volume of Rawls's and Harsanyi's theories of distributive justice. It focuses on Harsanyi's important Social Aggregation Theorem and technically reconstructs it as a theorem in welfarist social choice.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  11
    Reclassifying the Antithesis of Specker’s Theorem.Hannes Diener - 2012 - Archive for Mathematical Logic 51 (7-8):687-693.
    It is shown that a principle, which can be seen as a constructivised version of sequential compactness, is equivalent to a form of Brouwer’s fan theorem. The complexity of the latter depends on the geometry of the spaces involved in the former.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  41.  12
    Dugundji’s Theorem Revisited.Marcelo E. Coniglio & Newton M. Peron - 2014 - Logica Universalis 8 (3-4):407-422.
    In 1940 Dugundji proved that no system between S1 and S5 can be characterized by finite matrices. Dugundji’s result forced the development of alternative semantics, in particular Kripke’s relational semantics. The success of this semantics allowed the creation of a huge family of modal systems. With few adaptations, this semantics can characterize almost the totality of the modal systems developed in the last five decades. This semantics however has some limits. Two results of incompleteness showed that not every modal logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  31
    Arrow's Theorem, Weglorz' Models and the Axiom of Choice.Norbert Brunner & H. Reiju Mihara - 2000 - Mathematical Logic Quarterly 46 (3):335-359.
    Applying Weglorz' mode s of set theory without the axiom of choice, we investigate Arrow-type social we fare functions for infinite societies with restricted coalition algebras. We show that there is a reasonable, nondictatorial social welfare function satisfying “finite discrimination”, if and only if in Weglorz' mode there is a free ultrafilter on a set representing the individuals.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  19
    Herbrand's Theorem and Term Induction.Matthias Baaz & Georg Moser - 2005 - Archive for Mathematical Logic 45 (4):447-503.
    We study the formal first order system TIND in the standard language of Gentzen's LK . TIND extends LK by the purely logical rule of term-induction, that is a restricted induction principle, deriving numerals instead of arbitrary terms. This rule may be conceived as the logical image of full induction.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44.  10
    Coase's Theorem and the Speculative Withholding of Land.Walter Horn - 1985 - Land Economics 61 (2):208-217.
    In his classic paper on social costs, social scientist R. H. Coase has argued that in a world without transaction costs in the "buying and selling," of social benefits and damages, resource allocation would be unaffected by a change in the apportioning of liabilities. That is, whether or not a social nuisance-causer must pay damages to those to whom he is a nuisance, will not, in an efficient economy with no transaction costs, have any effect on resource allocation. In this (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  45. There's Something About Gdel: The Complete Guide to the Incompleteness Theorem.Francesco Berto - 2009 - Wiley-Blackwell.
    Berto’s highly readable and lucid guide introduces students and the interested reader to Gödel’s celebrated _Incompleteness Theorem_, and discusses some of the most famous - and infamous - claims arising from Gödel's arguments. Offers a clear understanding of this difficult subject by presenting each of the key steps of the _Theorem_ in separate chapters Discusses interpretations of the _Theorem_ made by celebrated contemporary thinkers Sheds light on the wider extra-mathematical and philosophical implications of Gödel’s theories Written in an accessible, non-technical (...)
  46. A Logic for Frege's Theorem.Richard Heck - 2011 - In Frege’s Theorem: An Introduction. Oxford University Press.
    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, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  47. Can Gödel's Incompleteness Theorem Be a Ground for Dialetheism?Seungrak Choi - 2017 - Korean Journal of Logic 20 (2):241-271.
    Dialetheism is the view that there exists a true contradiction. This paper ventures to suggest that Priest’s argument for Dialetheism from Gödel’s theorem is unconvincing as the lesson of Gödel’s proof (or Rosser’s proof) is that any sufficiently strong theories of arithmetic cannot be both complete and consistent. In addition, a contradiction is derivable in Priest’s inconsistent and complete arithmetic. An alternative argument for Dialetheism is given by applying Gödel sentence to the inconsistent and complete theory of arithmetic. We (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  26
    Easton’s Theorem in the Presence of Woodin Cardinals.Brent Cody - 2013 - Archive for Mathematical Logic 52 (5-6):569-591.
    Under the assumption that δ is a Woodin cardinal and GCH holds, I show that if F is any class function from the regular cardinals to the cardinals such that (1) ${\kappa < {\rm cf}(F(\kappa))}$ , (2) ${\kappa < \lambda}$ implies ${F(\kappa) \leq F(\lambda)}$ , and (3) δ is closed under F, then there is a cofinality-preserving forcing extension in which 2 γ = F(γ) for each regular cardinal γ < δ, and in which δ remains Woodin. Unlike the analogous (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  49.  19
    On the Strength of Ramsey's Theorem Without S1-Induction.Keita Yokoyama - 2013 - Mathematical Logic Quarterly 59 (1-2):108-111.
    In this paper, we show that equation image is a equation image-conservative extension of BΣ1 + exp, thus it does not imply IΣ1.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  7
    Generalizing Morley's Theorem.Tapani Hyttinen - 1998 - Mathematical Logic Quarterly 44 (2):176-184.
    We study the categoricity of the classes of elementary submodels of a homogeneous structure.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
1 — 50 / 999