Results for 'Infinite hierarchies of options'

971 found
Order:
  1.  57
    God and Infinite Hierarchies of Creatable Worlds.Bruce Langtry - 2006 - Faith and Philosophy 23 (4):460-476.
    This paper has been superseded by chapter 3 of my book "God, the Best, and Evil" (OUP 2008). The chapter concerns God's choices in cases in which God has infinitely many better and better options.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  2.  90
    Ever Better Situations and the Failure of Expression Principles.Dean Zimmerman - 2018 - Faith and Philosophy 35 (4):408-416.
    William Rowe argues that if an omnipotent, omniscient being were faced with an infinite hierarchy of better and better worlds to create, that being could not also be unsurpassably morally excellent. His argument assumes that, at least in ideal circumstances, degree of moral goodness must be perfectly expressed in the degree of goodness of the outcomes chosen. Reflection upon the application of analogous expression principles for certainty and desire shows that such principles can be expected to fail for anyone (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Frege’s Infinite Hierarchy of Senses.Lukas Skiba - 2022 - The Reasoner 16 (7):63-64.
  4.  91
    Frege's Commitment to an Infinite Hierarchy of Senses.Daniel R. Boisvert & Christopher M. Lubbers - 2003 - Philosophical Papers 32 (1):31-64.
    Abstract Though it has been claimed that Frege's commitment to expressions in indirect contexts not having their customary senses commits him to an infinite number of semantic primitives, Terrence Parsons has argued that Frege's explicit commitments are compatible with a two-level theory of senses. In this paper, we argue Frege is committed to some principles Parsons has overlooked, and, from these and other principles to which Frege is committed, give a proof that he is indeed committed to an (...) number of semantic primitives?an intolerable result. (shrink)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5. Discrete tense logic with beginning and ending time: An infinite hierarchy of complete axiomatic systems.L. Åqvist - 1991 - Logique Et Analyse 34:359-401.
     
    Export citation  
     
    Bookmark  
  6. Reply to Oppy on God, the Best and Evil.Bruce Langtry - 2011 - Sophia 50 (1):211-219.
    My reply corrects one misstatement in Oppy’s summary of my book, abandons a footnote in the light of one of Oppy’s criticisms, and argues that Oppy’s other criticisms do not succeed in showing either that my claims are mistaken or that the arguments by which I supported them are defective.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  7. The Method of In-between in the Grotesque and the Works of Leif Lage.Henrik Lübker - 2012 - Continent 2 (3):170-181.
    “Artworks are not being but a process of becoming” —Theodor W. Adorno, Aesthetic Theory In the everyday use of the concept, saying that something is grotesque rarely implies anything other than saying that something is a bit outside of the normal structure of language or meaning – that something is a peculiarity. But in its historical use the concept has often had more far reaching connotations. In different phases of history the grotesque has manifested its forms as a means of (...)
     
    Export citation  
     
    Bookmark  
  8. A Hierarchy of Classical and Paraconsistent Logics.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Journal of Philosophical Logic 49 (1):93-120.
    In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  9. The Hierarchy of Fregean Senses.Ori Simchen - 2018 - Thought: A Journal of Philosophy 7 (4):255-261.
    The question whether Frege’s theory of indirect reference enforces an infinite hierarchy of senses has been hotly debated in the secondary literature. Perhaps the most influential treatment of the issue is that of Burge (1979), who offers an argument for the hierarchy from rather minimal Fregean assumptions. I argue that this argument, endorsed by many, does not itself enforce an infinite hierarchy of senses. I conclude that whether or not the theory of indirect reference can avail itself of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  10.  27
    Modeling the Development of Children's Use of Optional Infinitives in Dutch and English Using MOSAIC.Daniel Freudenthal, Julian M. Pine & Fernand Gobet - 2006 - Cognitive Science 30 (2):277-310.
    In this study we use a computational model of language learning called model of syntax acquisition in children (MOSAIC) to investigate the extent to which the optional infinitive (OI) phenomenon in Dutch and English can be explained in terms of a resource-limited distributional analysis of Dutch and English child-directed speech. The results show that the same version of MOSAIC is able to simulate changes in the pattern of finiteness marking in 2 children learning Dutch and 2 children learning English as (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  11.  3
    On Frege’s supposed hierarchy of senses.Nicholas Georgalis - 2025 - Inquiry: An Interdisciplinary Journal of Philosophy 68 (2):696-717.
    This paper argues against the claim that Frege is committed to an infinite hierarchy of senses. Carnap and Kripke, along with many others, argue the contrary; I expose where all such arguments go astray. Invariably these arguments assume (without citation) that Frege holds that sense and reference are always distinct. This is the fulcrum upon which the hierarchy is hoisted. The counter to this assumption is based on two important but neglected passages. The locution ‘indirect sense’ has no ontological (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. On Frege's Supposed Hierarchy of Senses.Nicholas Georgalis - forthcoming - Inquiry: An Interdisciplinary Journal of Philosophy.
    This paper argues against the claim that Frege is committed to an infinite hierarchy of senses. Carnap and Kripke, along with many others, argue the contrary; I expose where all such arguments go astray. Invariably these arguments assume (without citation) that Frege holds that sense and reference are always distinct. This is the fulcrum upon which the hierarchy is hoisted. The counter to this assumption is based on two important but neglected passages. The locution ‘indirect sense’ has no ontological (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  28
    On the Origins of the Very First Principle as Infinite: The Hierarchy of the Infinite in Damascius and Pseudo-Dionysius the Areopagite.Tiziano F. Ottobrini - 2019 - Peitho 10 (1):133-152.
    This paper discusses the theoretical relationship between the views of Damascius and those of Pseudo-Dionysius the Areopagite. While Damascius’ De principiis is a bold treatise devoted to investigating the hypermetaphysics of apophatism, it anticipates various theoretical positions put forward by Dionysius the Areopagite. The present paper focuses on the following. First, Damascius is the only ancient philoso­pher who systematically demonstrates the first principle to be infinite. Second, Damascius modifies the concept and in several important passages shows the infinite (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  75
    A hierarchy of maps between compacta.Paul Bankston - 1999 - Journal of Symbolic Logic 64 (4):1628-1644.
    Let CH be the class of compacta (i.e., compact Hausdorff spaces), with BS the subclass of Boolean spaces. For each ordinal α and pair $\langle K,L\rangle$ of subclasses of CH, we define Lev ≥α K,L), the class of maps of level at least α from spaces in K to spaces in L, in such a way that, for finite α, Lev ≥α (BS,BS) consists of the Stone duals of Boolean lattice embeddings that preserve all prenex first-order formulas of quantifier rank (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15.  35
    Simulating the cross-linguistic pattern of Optional Infinitive errors in children’s declaratives and Wh- questions.Daniel Freudenthal, Julian M. Pine, Gary Jones & Fernand Gobet - 2015 - Cognition 143 (C):61-76.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  48
    A hierarchy of tree-automatic structures.Olivier Finkel & Stevo Todorčević - 2012 - Journal of Symbolic Logic 77 (1):350-368.
    We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) is not (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  17.  88
    An Endless Hierarchy of Probabilities.Jeanne Peijnenburg & David Atkinson - 2012 - American Philosophical Quarterly 49 (3):267-276.
    Suppose q is some proposition, and let P(q) = v0 (1) be the proposition that the probability of q is v0.1 How can one know that (1) is true? One cannot know it for sure, for all that may be asserted is a further probabilistic statement like P(P(q) = v0) = v1, (2) which states that the probability that (1) is true is v1. But the claim (2) is also subject to some further statement of an even higher probability: P(P(P(q) (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  6
    No Decreasing Sequence of Cardinals in the Hierarchy of Choice Principles.Eleftherios Tachtsis - 2024 - Notre Dame Journal of Formal Logic 65 (3):311-331.
    In set theory without the axiom of choice (AC), we study the relative strength of the principle “No decreasing sequence of cardinals,” that is, “There is no function f on ω such that |f(n+1)|<|f(n)| for all n∈ω” (NDS) with regard to its position in the hierarchy of weak choice principles. We establish the following results: (1) The Boolean prime ideal theorem plus countable choice does not imply NDS in ZF; (2) “Every non-well-orderable set has a well-orderable partition into denumerable sets” (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19. Infinite options, intransitive value, and supererogation.Daniel Muñoz - 2020 - Philosophical Studies 178 (6):2063-2075.
    Supererogatory acts are those that lie “beyond the call of duty.” There are two standard ways to define this idea more precisely. Although the definitions are often seen as equivalent, I argue that they can diverge when options are infinite, or when there are cycles of better options; moreover, each definition is acceptable in only one case. I consider two ways out of this dilemma.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  20.  58
    A Consistent Set of Infinite-Order Probabilities.David Atkinson & Jeanne Peijnenburg - 2013 - International Journal of Approximate Reasoning 54:1351-1360.
    Some philosophers have claimed that it is meaningless or paradoxical to consider the probability of a probability. Others have however argued that second-order probabilities do not pose any particular problem. We side with the latter group. On condition that the relevant distinctions are taken into account, second-order probabilities can be shown to be perfectly consistent. May the same be said of an infinite hierarchy of higher-order probabilities? Is it consistent to speak of a probability of a probability, and of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  21.  37
    Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (6):1201-1241.
    It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial Π10 subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise computability. As for nonempty Π10 subsets of Cantor space, we show the existence of a finite-Δ20-piecewise degree containing infinitely many finite-2-piecewise degrees, and a finite-2-piecewise degree containing infinitely many finite-Δ20-piecewise degrees 2 denotes the difference of two Πn0 sets), whereas the greatest degrees in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  43
    Infinite-dimensional Ellentuck spaces and Ramsey-classification theorems.Natasha Dobrinen - 2016 - Journal of Mathematical Logic 16 (1):1650003.
    We extend the hierarchy of finite-dimensional Ellentuck spaces to infinite dimensions. Using uniform barriers [Formula: see text] on [Formula: see text] as the prototype structures, we construct a class of continuum many topological Ramsey spaces [Formula: see text] which are Ellentuck-like in nature, and form a linearly ordered hierarchy under projections. We prove new Ramsey-classification theorems for equivalence relations on fronts, and hence also on barriers, on the spaces [Formula: see text], extending the Pudlák–Rödl theorem for barriers on the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  23.  54
    Epistemic Logic and the Theory of Games and Decisions.M. Bacharach, Louis André Gerard-Varet, Philippe Mongin & H. S. Shin (eds.) - 1997 - Dordrecht: Springer.
    This collection of papers in epistemic logic is oriented towards applications to game theory and individual decision theory. Most of these papers were presented at the inaugural conference of the LOFT (Logic for the Theory and Games and Decisions) conference series, which took place in 1994 in Marseille. Among the notions dealt with are those of common knowledge and common belief, infinite hierarchies of beliefs and belief spaces, logical omniscience, positive and negative introspection, backward induction and rationalizable equilibria (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  24.  20
    Hindman’s theorem in the hierarchy of choice principles.David Fernández-Bretón - 2023 - Journal of Mathematical Logic 24 (1).
    In the context of [Formula: see text], we analyze a version of Hindman’s finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various classical weak choice principles, thus precisely locating the strength of the statement as a weak form of the [Formula: see text].
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  36
    Identifying Spinoza’s Immediate Infinite Mode of Extension.Thaddeus S. Robinson - 2014 - Dialogue 53 (2):315-340.
    Le mode infini immédiat de l’étendue (MIIE) est l’un des éléments les plus mystérieux de l’ontologie de Spinoza. Malgré son importance pour le système métaphysique de Spinoza, ce dernier nous dit très peu à propos de ce mode. Dans un effort pour faire progresser l’étude de cette question, j’examine trois hypothèses bien acceptées qui traitent de l’identité de ce mode : l’interprétation de la force, l’interprétation nomique et l’interprétation cinétique. J’affirme premièrement que l’interprétation de la force et l’interprétation nomique doivent (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  49
    Can a single account of supererogation handle both finite and infinite cases?Holly M. Smith - 2023 - Philosophical Studies 180 (8):2399-2413.
    Discussions of supererogation usually focus on cases in which the agent can choose among a finite number of options. However, Daniel Muñoz has recently shown that cases in which the agent faces an infinite chain of increasingly less good options make trouble for existing definitions of supererogation. Muñoz proposes a promising new definition as a solution to the problem of infinite cases. I argue that any acceptable account of supererogation must (1) enable us to accurately identify (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27. An Infinite Decision Puzzle.Jeffrey Barrett & Frank Arntzenius - 1999 - Theory and Decision 46 (1):101-103.
    We tell a story where an agent who chooses in such a way as to make the greatest possible profit on each of an infinite series of transactions ends up worse off than an agent who chooses in such a way as to make the least possible profit on each transaction. That is, contrary to what one might suppose, it is not necessarily rational always to choose the option that yields the greatest possible profit on each transaction.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  28. Tarski hierarchies.Volker Halbach - 1995 - Erkenntnis 43 (3):339 - 367.
    The general notions of object- and metalanguage are discussed and as a special case of this relation an arbitrary first order language with an infinite model is expanded by a predicate symbol T0 which is interpreted as truth predicate for . Then the expanded language is again augmented by a new truth predicate T1 for the whole language plus T0. This process is iterated into the transfinite to obtain the Tarskian hierarchy of languages. It is shown that there are (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  29.  23
    The Options of Contemporary Ethical Theory.Joseph Margolis - 1987 - Philosophy and Literature 11 (1):37-56.
    In lieu of an abstract, here is a brief excerpt of the content:Joseph Margolis THE OPTIONS OF CONTEMPORARY ETHICAL THEORY It may be said, with some prospect ofbeing not altogether idiotic, that the global philosophical question ofour age concerns the possibility of legitimating the conceptual grounds for legitimating claims about anything. The formulation has no interest in the abstract. It merely registers the possibility of an infinite regress; and in that form it has been with us forever. But (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  30.  40
    Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives.Kentaro Sato - 2020 - Annals of Pure and Applied Logic 171 (3):102754.
    We introduce a new axiom called inductive dichotomy, a weak variant of the axiom of inductive definition, and analyze the relationships with other variants of inductive definition and with related axioms, in the general second order framework, including second order arithmetic, second order set theory and higher order arithmetic. By applying these results to the investigations on the determinacy axioms, we show the following. (i) Clopen determinacy is consistency-wise strictly weaker than open determinacy in these frameworks, except second order arithmetic; (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  31. Parsimony hierarchies for inductive inference.Andris Ambainis, John Case, Sanjay Jain & Mandayam Suraj - 2004 - Journal of Symbolic Logic 69 (1):287-327.
    Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and "nearly" minimal size, i.e., within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. A lim-computablefunction is (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32. God, Evil, and the Contemplation of Infinitely Many Options.Dean Zimmerman - 2006 - Philosophic Exchange 36 (1).
    This essay examines the problem of evil, and then develops a free will theodicy. Then the paper considers some themes in distinctively Christian theodicy building, in more detail.
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  33.  27
    The computational strengths of α-tape infinite time Turing machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.
    In [7], open questions are raised regarding the computational strengths of so-called ∞-α -Turing machines, a family of models of computation resembling the infinite-time Turing machine model of [2], except with α -length tape . Let TαTα denote the machine model of tape length α . Define that TαTα is computationally stronger than TβTβ precisely when TαTα can compute all TβTβ-computable functions ƒ: min2→min2 plus more. The following results are found: Tω1≻TωTω1≻Tω. There are countable ordinals α such that Tα≻TωTα≻Tω, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34. Old foundations for the logic of agency and action.Lennart Åqvist - 2002 - Studia Logica 72 (3):313-338.
    The paper presents an infinite hierarchy of sound and complete axiomatic systems for Two-Dimensional Modal Tense Logic with Historical Necessity, Agents and Acts. A main novelty of these logics is their capacity to represent formally (i) basic action-sentences asserting that such and such an act is performed/omitted by an agent, as well as (ii) causative action-sentences asserting that by performing/omitting a certain act, an agent causes that such and such a state-of-affairs is realized (e.g. comes about/ceases/remains/remains absent). We illustrate (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  35. Standard Decision Theory Corrected: Assessing Options When Probability is Infinitely and Uniformly Spread.Peter Vallentyne - 2000 - Synthese 122 (3):261-290.
    Where there are infinitely many possible [equiprobable] basic states of the world, a standard probability function must assign zero probability to each state—since any finite probability would sum to over one. This generates problems for any decision theory that appeals to expected utility or related notions. For it leads to the view that a situation in which one wins a million dollars if any of a thousand of the equally probable states is realized has an expected value of zero (since (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  36.  48
    Rogers semilattices of families of two embedded sets in the Ershov hierarchy.Serikzhan A. Badaev, Mustafa Manat & Andrea Sorbi - 2012 - Mathematical Logic Quarterly 58 (4-5):366-376.
    Let a be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient condition on a, so that for every \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\Sigma ^{-1}_a$\end{document}‐computable family of two embedded sets, i.e., two sets A, B, with A properly contained in B, the Rogers semilattice of the family is infinite. This condition is satisfied by every notation of ω; moreover every nonzero computable ordinal that is not sum of any two smaller ordinals has a notation that satisfies this condition. On (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  18
    Infinite Wordle and the mastermind numbers.Joel David Hamkins - forthcoming - Mathematical Logic Quarterly.
    I consider the natural infinitary variations of the games Wordle and Mastermind, as well as their game‐theoretic variations Absurdle and Madstermind, considering these games with infinitely long words and infinite color sequences and allowing transfinite game play. For each game, a secret codeword is hidden, which the codebreaker attempts to discover by making a series of guesses and receiving feedback as to their accuracy. In Wordle with words of any size from a finite alphabet of n letters, including (...) words or even uncountable words, the codebreaker can nevertheless always win in n steps. Meanwhile, the mastermind number, defined as the smallest winning set of guesses in infinite Mastermind for sequences of length ω over a countable set of colors without duplication, is uncountable, but the exact value turns out to be independent of, for it is provably equal to the eventually different number, which is the same as the covering number of the meager ideal. I thus place all the various mastermind numbers, defined for the natural variations of the game, into the hierarchy of cardinal characteristics of the continuum. (shrink)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  88
    The fine structure of the intuitionistic borel hierarchy.Wim Veldman - 2009 - Review of Symbolic Logic 2 (1):30-101.
    In intuitionistic analysis, a subset of a Polish space like or is called positively Borel if and only if it is an open subset of the space or a closed subset of the space or the result of forming either the countable union or the countable intersection of an infinite sequence of (earlier constructed) positively Borel subsets of the space. The operation of taking the complement is absent from this inductive definition, and, in fact, the complement of a positively (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39. On Indirect Sense and Reference.Lukas Skiba - 2014 - Theoria 81 (1):48-81.
    According to Frege, expressions shift their reference when they occur in indirect contexts: in “Anna believes that Plato is wise” the expression “Plato” no longer refers to Plato but to what is ordinarily its sense. Many philosophers, including Carnap, Davidson, Burge, Parsons, Kripke and Künne, believe that on Frege's view the iteration of indirect context creating operators gives rise to an infinite hierarchy of senses. While the former two take this to be problematic, the latter four welcome the hierarchy (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  40.  51
    Aggregating infinitely many probability measures.Frederik Herzberg - 2015 - Theory and Decision 78 (2):319-337.
    The problem of how to rationally aggregate probability measures occurs in particular when a group of agents, each holding probabilistic beliefs, needs to rationalise a collective decision on the basis of a single ‘aggregate belief system’ and when an individual whose belief system is compatible with several probability measures wishes to evaluate her options on the basis of a single aggregate prior via classical expected utility theory. We investigate this problem by first recalling some negative results from preference and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  41. (1 other version)Hierarchy, form, and reality.Gang Chen - 2009 - Frontiers of Philosophy in China 4 (3):437-453.
    Scientific progress in the 20th century has shown that the structure of the world is hierarchical. A philosophical analysis of the hierarchy will bear obvious significance for metaphysics and philosophy in general. Jonathan Schaffer’s paper, “Is There a Fundamental Level?”, provides a systematic review of the works in the field, the difficulties for various versions of fundamentalism, and the prospect for the third option, i.e., to treat each level as ontologically equal. The purpose of this paper is to provide an (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  77
    Truth, Hierarchy and Incoherence.Bruno Whittle - 2017 - In Bradley P. Armour-Garb (ed.), Reflections on the Liar. Oxford, England: Oxford University.
    Approaches to truth and the Liar paradox seem invariably to face a dilemma: either appeal to some sort of hierarchy, or declare apparently perfectly coherent concepts incoherent. But since both options lead to severe expressive restrictions, neither seems satisfactory. The aim of this paper is a new approach, which avoids the dilemma and the resulting expressive restrictions. Previous approaches tend to appeal to some new sort of semantic value for the truth predicate to take. I argue that such approaches (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  43. Longtermism in an infinite world.Christian Tarsney & Hayden Wilkinson - 2025 - In Jacob Barrett, Hilary Greaves & David Thorstad (eds.), Essays on Longtermism: Present Action for the Distant Future. Oxford University Press.
    The case for longtermism depends on the vast potential scale of the future. But that same vastness also threatens to undermine the case for longtermism: If the universe as a whole, or the future in particular, contain infinite quantities of value and/or disvalue, then many of the theories of value that support longtermism (e.g., risk-neutral total utilitarianism) seem to imply that none of our available options are better than any other. If so, then even apparently vast effects on (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  78
    Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
    Infinite time Turing machines represent a model of computability that extends the operations of Turing machines to transfinite ordinal time by defining the content of each cell at limit steps to be the lim sup of the sequences of previous contents of that cell. In this paper, we study a computational model obtained by replacing the lim sup rule with an ‘eventually constant’ rule: at each limit step, the value of each cell is defined if and only if the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  45.  86
    The structure of intrinsic complexity of learning.Sanjay Jain & Arun Sharma - 1997 - Journal of Symbolic Logic 62 (4):1187-1201.
    Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (from a graph of the function) have served as models for investigating the boundaries of learnability. Recently, a new approach to the study of "intrinsic" complexity of identification in the limit has been proposed. This approach, instead of dealing with the resource requirements of the learning algorithm, uses the notion of reducibility from recursion theory to compare (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  24
    On the finite axiomatizability of.Chris Pollett - 2018 - Mathematical Logic Quarterly 64 (1-2):6-24.
    The question of whether the bounded arithmetic theories and are equal is closely connected to the complexity question of whether is equal to. In this paper, we examine the still open question of whether the prenex version of,, is equal to. We give new dependent choice‐based axiomatizations of the ‐consequences of and. Our dependent choice axiomatizations give new normal forms for the ‐consequences of and. We use these axiomatizations to give an alternative proof of the finite axiomatizability of and to (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  10
    Lessons of the Liar.Scott Soames - 1998 - In Understanding Truth. Oxford and New York: Oxford University Press USA.
    In proving that the language of arithmetic does not contain its own truth predicate, Tarski demonstrated that the claim that a language both satisfies certain minimal conditions and contains its own truth predicate leads to a contradiction – a result that can seem puzzling in light of the fact that it seems obvious that English does satisfy the relevant conditions, while containing its own truth predicate. Chapter 5 explores the well‐known response to this problem, which maintains that English is really (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  48. The logic of historical necessity as founded on two-dimensional modal tense logic.Lennart Åqvist - 1999 - Journal of Philosophical Logic 28 (4):329-369.
    We consider a version of so called T x W logic for historical necessity in the sense of R.H. Thomason (1984), which is somewhat special in three respects: (i) it is explicitly based on two-dimensional modal logic in the sense of Segerberg (1973); (ii) for reasons of applicability to interesting fields of philosophical logic, it conceives of time as being discrete and finite in the sense of having a beginning and an end; and (iii) it utilizes the technique of systematic (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  49.  71
    Decomposing Borel functions and structure at finite levels of the Baire hierarchy.Janusz Pawlikowski & Marcin Sabok - 2012 - Annals of Pure and Applied Logic 163 (12):1748-1764.
    We prove that if f is a partial Borel function from one Polish space to another, then either f can be decomposed into countably many partial continuous functions, or else f contains the countable infinite power of a bijection that maps a convergent sequence together with its limit onto a discrete space. This is a generalization of a dichotomy discovered by Solecki for Baire class 1 functions. As an application, we provide a characterization of functions which are countable unions (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  50. Infinitely Complex Machines.Eric Steinhart - 2007 - In Intelligent Computing Everywhere. Springer. pp. 25-43.
    Infinite machines (IMs) can do supertasks. A supertask is an infinite series of operations done in some finite time. Whether or not our universe contains any IMs, they are worthy of study as upper bounds on finite machines. We introduce IMs and describe some of their physical and psychological aspects. An accelerating Turing machine (an ATM) is a Turing machine that performs every next operation twice as fast. It can carry out infinitely many operations in finite time. Many (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 971