Results for 'well‐founded tree'

999 found
Order:
  1.  29
    A Non-Well-Founded Primitive Recursive Tree Provably Well-Founded for Co-R.E. Sets.Arnold Beckmann - 2002 - Archive for Mathematical Logic 41 (3):251-257.
    We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ1 0. It follows that the supremum of order-types of primitive recursive well-orderings, whose well-foundedness on co-r.e. sets is provable in Σ1 0, equals the limit of all recursive ordinals ω1 ck . RID=""ID="" Mathematics Subject Classification (2000): 03B30, 03F15 RID=""ID="" Supported by the Deutschen Akademie der Naturforscher Leopoldina grant #BMBF-LPD 9801-7 with funds from the Bundesministerium für Bildung, Wissenschaft, Forschung und Technologie. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  2.  7
    Tree-Automatic Well-Founded Trees.Alexander Kartzow, Jiamou Liu & Markus Lohrey - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 363--373.
  3. Well- and Non-Well-Founded Fregean Extensions.Ignacio Jané & Gabriel Uzquiano - 2004 - Journal of Philosophical Logic 33 (5):437-465.
    George Boolos has described an interpretation of a fragment of ZFC in a consistent second-order theory whose only axiom is a modification of Frege's inconsistent Axiom V. We build on Boolos's interpretation and study the models of a variety of such theories obtained by amending Axiom V in the spirit of a limitation of size principle. After providing a complete structural description of all well-founded models, we turn to the non-well-founded ones. We show how to build models in which foundation (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  4.  36
    Classification of Non‐Well‐Founded Sets and an Application.Nitta Takashi, Okada Tomoko & Athanassios Tzouvaras - 2003 - Mathematical Logic Quarterly 49 (2):187-200.
    A complete list of Finsler, Scott and Boffa sets whose transitive closures contain 1, 2 and 3 elements is given. An algorithm for deciding the identity of hereditarily finite Scott sets is presented. Anti-well-founded sets, i. e., non-well-founded sets whose all maximal ∈-paths are circular, are studied. For example they form transitive inner models of ZFC minus foundation and empty set, and they include uncountably many hereditarily finite awf sets. A complete list of Finsler and Boffa awf sets with 2 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  43
    Well-Founded Semantics for Defeasible Logic.Frederick Maier & Donald Nute - 2010 - Synthese 176 (2):243 - 274.
    Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute's defeasible logic. The semantics are based upon the well-founded semantics for logic programs. It is shown that the logics are sound with respect to their counterpart semantics and complete for locally finite theories. Unlike some other nonmonotonic reasoning formalisms such as Reiter's default logic, the two defeasible logics are directly skeptical and so reject floating conclusions. For defeasible theories with transitive priorities on defeasible rules, the logics are shown (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  6.  19
    Finitely Generated Free Heyting Algebras: The Well-Founded Initial Segment.R. Elageili & J. K. Truss - 2012 - Journal of Symbolic Logic 77 (4):1291-1307.
    In this paper we describe the well-founded initial segment of the free Heyting algebra α on finitely many, α, generators. We give a complete classification of initial sublattices of ₂ isomorphic to ₁ (called 'low ladders'), and prove that for 2 < α < ω, the height of the well-founded initial segment of α.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  7. Well-Founded Belief: An Introduction.J. Adam Carter & Patrick Bondy - 2019 - In J. Adam Carter & Patrick Bondy (eds.), Well-Founded Belief: New Essays on the Epistemic Basing Relation. Routledge.
    This is the Editor's Introduction to "Well-Founded Belief: New Essays on the Epistemic Basing Relation" (Routledge, 2020).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. Well-Founded Belief and the Contingencies of Epistemic Location.Guy Axtell - 2020 - In Patrick Bondy & J. Adam Carter (eds.), Well Founded Belief: New Essays on the Epistemic Basing Relation. London: Routledge, 2019.
    A growing number of philosophers are concerned with the epistemic status of culturally nurtured beliefs, beliefs found especially in domains of morals, politics, philosophy, and religion. Plausibly, worries about the deep impact of cultural contingencies on beliefs in these domains of controversial views is a question about well-foundedness: Does it defeat well-foundedness if the agent is rationally convinced that she would take her own reasons for belief as insufficiently well-founded, or would take her own belief as biased, had she been (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  15
    Non‐Well‐Founded Extensions of Documentclass{Article}Usepackage{Amssymb}Begin{Document}Pagestyle{Empty}$Mathbf {V}$End{Document}.William R. Brian - 2013 - Mathematical Logic Quarterly 59 (3):167-176.
  10.  7
    Non‐Circular, Non‐Well‐Founded Set Universes.Athanassios Tzouvaras - 1993 - Mathematical Logic Quarterly 39 (1):454-460.
    We show that there are universes of sets which contain descending ϵ-sequences of length α for every ordinal α, though they do not contain any ϵ-cycle. It is also shown that there is no set universe containing a descending ϵ-sequence of length On. MSC: 03E30; 03E65.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  11.  22
    James Sequences and Dependent Choices.Marianne Morillon - 2005 - Mathematical Logic Quarterly 51 (2):171-186.
    We prove James's sequential characterization of reflexivity in set-theory ZF + DC, where DC is the axiom of Dependent Choices. In turn, James's criterion implies that every infinite set is Dedekind-infinite, whence it is not provable in ZF. Our proof in ZF + DC of James' criterion leads us to various notions of reflexivity which are equivalent in ZFC but are not equivalent in ZF. We also show that the weak compactness of the closed unit ball of a reflexive space (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  12.  82
    Perceptual Knowledge and Well-Founded Belief.Alan Millar - 2016 - Episteme 13 (1):43-59.
    Should a philosophical account of perceptual knowledge accord a justificatory role to sensory experiences? This discussion raises problems for an affirmative answer and sets out an alternative account on which justified belief is conceived as well-founded belief and well-foundedness is taken to depend on knowledge. A key part of the discussion draws on a conception of perceptual-recognitional abilities to account for how perception gives rise both to perceptual knowledge and to well-founded belief.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  13.  92
    Is There a Well-Founded Solution to the Generality Problem?Jonathan D. Matheson - 2015 - Philosophical Studies 172 (2):459-468.
    The generality problem is perhaps the most notorious problem for process reliabilism. Several recent responses to the generality problem have claimed that the problem has been unfairly leveled against reliabilists. In particular, these responses have claimed that the generality problem is either (i) just as much of a problem for evidentialists, or (ii) if it is not, then a parallel solution is available to reliabilists. Along these lines, Juan Comesaña has recently proposed solution to the generality problem—well-founded reliabilism. According to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14. Is There a Viable Account of Well-Founded Belief?Maria Lasonen-Aarnio - 2010 - Erkenntnis 72 (2):205-231.
    My starting point is some widely accepted and intuitive ideas about justified, well-founded belief. By drawing on John Pollock’s work, I sketch a formal framework for making these ideas precise. Central to this framework is the notion of an inference graph. An inference graph represents everything that is relevant about a subject for determining which of her beliefs are justified, such as what the subject believes based on what. The strengths of the nodes of the graph represent the degrees of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15.  18
    An Infinite-Game Semantics for Well-Founded Negation in Logic Programming.Chrysida Galanaki, Panos Rondogiannis & William W. Wadge - 2008 - Annals of Pure and Applied Logic 151 (2-3):70-88.
    We present an infinite-game characterization of the well-founded semantics for function-free logic programs with negation. Our game is a simple generalization of the standard game for negation-less logic programs introduced by van Emden [M.H. van Emden, Quantitative deduction and its fixpoint theory, Journal of Logic Programming 3 37–53] in which two players, the Believer and the Doubter, compete by trying to prove a query. The standard game is equivalent to the minimum Herbrand model semantics of logic programming in the sense (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16.  16
    Well-Founded Belief and Perceptual Justification.Fernando Broncano-Berrocal - 2016 - Proceedings of the Aristotelian Society 116 (3):367-377.
    According to Alan Millar, justified beliefs are well-founded beliefs. Millar cashes out the notion of well-foundedness in terms of having an adequate reason to believe something and believing it for that reason. To make his account of justified belief compatible with perceptual justification he appeals to the notion of recognitional ability. It is argued that, due to the fact that Millar’s is a knowledge-first view, his appeal to recognitional abilities fails to offer an explanatory account of familiar cases in the (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  17.  30
    Well-Founded Semantics, Generalized.Melvin C. Fitting - unknown
    Classical fixpoint semantics for logic programs is based on the TP immediate consequence operator. The Kripke/Kleene, three-valued, semantics uses ΦP, which extends TP to Kleene’s strong three-valued logic. Both these approaches generalize to cover logic programming systems based on a wide class of logics, provided only that the underlying structure be that of a bilattice. This was presented in earlier papers. Recently well-founded semantics has become influential for classical logic programs. We show how the well-founded approach also extends naturally to (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  18.  21
    Dialectica Interpretation of Well-Founded Induction.Helmut Schwichtenberg - 2008 - Mathematical Logic Quarterly 54 (3):229-239.
    From a classical proof that the gcd of natural numbers a1 and a2 is a linear combination of the two, we extract by Gödel's Dialectica interpretation an algorithm computing the coefficients. The proof uses the minimum principle. We show generally how well-founded recursion can be used to Dialectica interpret well-founded induction, which is needed in the proof of the minimum principle. In the special case of the example above it turns out that we obtain a reasonable extracted term, representing an (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19.  14
    Non-Well-Founded Trees in Categories.Benno van den Berg & Federico De Marchi - 2007 - Annals of Pure and Applied Logic 146 (1):40-59.
    Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Categorically, they arise as final coalgebras for polynomial endofunctors, which we call M-types. We derive existence results for M-types in locally cartesian closed pretoposes with a natural numbers object, using their internal logic. These are then used to prove stability of such categories with M-types under various topos-theoretic constructions; namely, slicing, formation of coalgebras , and sheaves for an (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  20.  30
    Models of Non-Well-Founded Sets Via an Indexed Final Coalgebra Theorem.Benno van Den Berg & Federico de Marchi - 2007 - Journal of Symbolic Logic 72 (3):767-791.
    The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on finitely complete and cocomplete categories. As an instance of this result, we build the final coalgebra for the powerclass functor, in the context of a Heyting pretopos with a class of small maps. This is then proved to provide models for various non-well-founded set theories, depending on the chosen axiomatisation (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  26
    A Construction of Non-Well-Founded Sets Within Martin-Löf's Type Theory.Ingrid Lindström - 1989 - Journal of Symbolic Logic 54 (1):57-64.
    In this paper, we show that non-well-founded sets can be defined constructively by formalizing Hallnäs' limit definition of these within Martin-Löf's theory of types. A system is a type W together with an assignment of ᾱ ∈ U and α̃ ∈ ᾱ → W to each α ∈ W. We show that for any system W we can define an equivalence relation = w such that α = w β ∈ U and = w is the maximal bisimulation. Aczel's proof (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  58
    On Modal Μ-Calculus and Non-Well-Founded Set Theory.Luca Alberucci & Vincenzo Salipante - 2004 - Journal of Philosophical Logic 33 (4):343-360.
    A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new interlinks between automata theory and non-well-founded sets.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  23.  12
    Modeling the Suppression Task Under Weak Completion and Well-Founded Semantics.Emmanuelle-Anna Dietz, Steffen Hölldobler & Christoph Wernhard - 2014 - Journal of Applied Non-Classical Logics 24 (1-2):61-85.
    Formal approaches that aim at representing human reasoning should be evaluated based on how humans actually reason. One way of doing so is to investigate whether psychological findings of human reasoning patterns are represented in the theoretical model. The computational logic approach discussed here is the so-called weak completion semantics which is based on the three-valued ?ukasiewicz logic. We explain how this approach adequately models Byrne?s suppression task, a psychological study where the experimental results show that participants? conclusions systematically deviate (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  53
    Ten Myths About Character, Virtue and Virtue Education – Plus Three Well-Founded Misgivings.Kristján Kristjánsson - 2013 - British Journal of Educational Studies 61 (3):269-287.
    ABSTRACT Initiatives to cultivate character and virtue in moral education at school continue to provoke sceptical responses. Most of those echo familiar misgivings about the notions of character, virtue and education in virtue ? as unclear, redundant, old-fashioned, religious, paternalistic, anti-democratic, conservative, individualistic, relative and situation dependent. I expose those misgivings as ?myths?, while at the same time acknowledging three better-founded historical, methodological and practical concerns about the notions in question.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  25. A Well-Founded Solution to the Generality Problem.Juan Comesaña - 2006 - Philosophical Studies 129 (1):27-47.
  26.  14
    Non-Well-Founded Sets.J. L. Bell - 1989 - Journal of Symbolic Logic 54 (3):1111-1112.
    Direct download  
     
    Export citation  
     
    Bookmark   48 citations  
  27.  86
    Dependence, Justification and Explanation: Must Reality Be Well-Founded?Matteo Morganti - 2015 - Erkenntnis 80 (3):555-572.
    This paper is about metaphysical ‘infinitism’, the view that there are, or could be, infinite chains of ontological dependence. Its main aim is to show that, contrary to widespread opinion, metaphysical infinitism is a coherent position. On the basis of this, it is then additionally argued that metaphysical infinitism need not fare worse than the more canonical ‘foundationalist’ alternatives when it comes to formulating metaphysical explanations. In the course of the discussion, a rather unexplored parallel with the debate concerning infinitism (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  28. Well Founded Belief: New Essays on the Epistemic Basing Relation.Joseph Adam Carter & Patrick Bondy (eds.) - 2019 - Routledge.
     
    Export citation  
     
    Bookmark   1 citation  
  29.  6
    Anti-Representationalism: Not a Well-Founded Theory of Cognition.Michael David Kirchhoff - 2011 - Res Cogitans 8 (2).
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  51
    Non-Well-Founded Sets Via Revision Rules.Gian Aldo Antonelli - 1994 - Journal of Philosophical Logic 23 (6):633 - 679.
  31.  15
    On Non-Well-Founded Sets.W. D. Hart - 1992 - Critica 24 (72):3-21.
  32.  9
    Indivisible Sets and Well‐Founded Orientations of the Rado Graph.Nathanael L. Ackerman & Will Brian - 2019 - Mathematical Logic Quarterly 65 (1):46-56.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  3
    Recursive Well-Founded Orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.
  34.  17
    The Basic Assumptions of E-Z Reader Are Not Well-Founded.Françoise Vitu - 2003 - Behavioral and Brain Sciences 26 (4):506-507.
    This commentary focuses on the two basic assumptions of the E-Z Reader model, discussing the possibility that adjacent words in reading may be processed in parallel rather than serially, and presenting evidence against a cognitive control of eye guidance in reading.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  7
    Book Review: Well-Founded Hope. [REVIEW]Gerald G. O'Collins - 1970 - Interpretation: A Journal of Bible and Theology 24 (3):408-409.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  35
    Hölder, Mach, and the Law of the Lever: A Case of Well-Founded Non-Controversy.Oliver Schlaudt - 2013 - Philosophia Scientiæ 17 (17-1):93-116.
    Nous analysons la réponse qu’a donnée Otto Hölder à la célèbre critique de la preuve archimédienne de la loi du levier par Ernst Mach et nous la situons dans sa pensée epistémologique. Pour Hölder, la preuve de la loi du levier fournit une étude de cas sur la déduction en mécanique. Considérant la preuve comme un processus constructif et synthétique montant d’un niveau conceptuel à un niveau supérieur, Hölder parvient à défendre la preuve d’Archimède contre la critique de Mach, pour (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  1
    Non-Well-Founded Derivations in the Gödel-Löb Provability Logic.Daniyar Shamkanov - forthcoming - Review of Symbolic Logic:1-22.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  19
    Truth in All of Certain Well‐Founded Countable Models Arising in Set Theory.John W. Rosenthal - 1975 - Mathematical Logic Quarterly 21 (1):97-106.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  39.  7
    Book Review: Well-Founded HopeWell-Founded Hope, by BerkhofHendrikus. John Knox Press, Richmond, Va., 1969. 107 Pp. $3.25. [REVIEW]Gerald G. O'Collins - 1970 - Interpretation 24 (3):408-409.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  18
    Is Freud's Theory Well-Founded?Adolf Grünbaum - 1986 - Behavioral and Brain Sciences 9 (2):266-284.
  41.  13
    Aczel Peter. Non-Well-Founded Sets. With a Foreword by Jon Barwise. CSLI Lecture Notes, No. 14. Center for the Study of Language and Information, Stanford 1988, Also Distributed by the University of Chicago Press, Chicago, Xx+ 131 Pp. [REVIEW]J. L. Bell - 1989 - Journal of Symbolic Logic 54 (3):1111-1114.
  42.  7
    Hölder, Mach, and the Law of the Lever: A Case of Well-Founded Non-Controversy.Oliver Schlaudt - 2013 - Philosophia Scientae 17:93-116.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43. Non-Well-Founded Extensions of V.William R. Brian - 2013 - Mathematical Logic Quarterly 59 (3):167-176.
     
    Export citation  
     
    Bookmark  
  44.  8
    Review: Peter Aczel, Jon Barwise, Non-Well-Founded Sets. [REVIEW]M. Boffa - 1989 - Journal of Symbolic Logic 54 (3):1111-1112.
  45.  11
    Book Review: Peter Aczel. Non-Well-Founded Sets. [REVIEW]R. Hinnion - 1989 - Notre Dame Journal of Formal Logic 30 (2):308-312.
  46.  5
    Σ1-Well-Founded Compactness.Nigel Cutland & Matt Kauffmann - 1980 - Annals of Mathematical Logic 18 (3):271-296.
  47. Well-Founded Belief: New Essays on the Basing Relation.J. Adam Carter & Patrick Bondy (eds.) - forthcoming
    No categories
     
    Export citation  
     
    Bookmark  
  48. Well Founding Grounding Grounding.Gabriel Oak Rabin & Brian Rabern - 2016 - Journal of Philosophical Logic 45 (4):349-379.
    Those who wish to claim that all facts about grounding are themselves grounded (“the meta-grounding thesis”) must defend against the charge that such a claim leads to infinite regress and violates the well-foundedness of ground. In this paper, we defend. First, we explore three distinct but related notions of “well-founded”, which are often conflated, and three corresponding notions of infinite regress. We explore the entailment relations between these notions. We conclude that the meta-grounding thesis need not lead to tension with (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  49.  5
    The Well and the Tree: World and Time in Early Germanic Culture. Paul C. Bauschatz.Ernst S. Dick - 1984 - Speculum 59 (3):616-619.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  50. Canonical Simplification of Finite Objects, Well Quasi-Ordered by Tree Embedding.Thomas C. Brown - 1979 - Dept. Of Computer Science, University of Illinois at Urbana-Champaign.
     
    Export citation  
     
    Bookmark  
1 — 50 / 999