Results for ' fixed‐point approach'

999 found
Order:
  1.  25
    Fixed points and well-ordered societies.Paul Weithman - 2023 - Politics, Philosophy and Economics 22 (2):197-212.
    Recent years have seen a certain impatience with John Rawls's approach to political philosophy and calls for the discipline to move beyond it. One source of dissatisfaction is Rawls's idea of a well-ordered society. In a recent article, Alex Schaefer has tried to give further impetus to this movement away from Rawlsian theorizing by pursuing a question about well-ordered societies that he thinks other critics have not thought to ask. He poses that question in the title of his article: (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  20
    Fixed-point models for paradoxical predicates.Luca Castaldo - 2021 - Australasian Journal of Logic 18 (7):688-723.
    This paper introduces a new kind of fixed-point semantics, filling a gap within approaches to Liar-like paradoxes involving fixed-point models à la Kripke (1975). The four-valued models presented below, (i) unlike the three-valued, consistent fixed-point models defined in Kripke (1975), are able to differentiate between paradoxical and pathological-but-unparadoxical sentences, and (ii) unlike the four-valued, paraconsistent fixed-point models first studied in Visser (1984) and Woodruff (1984), preserve consistency and groundedness of truth.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  18
    J. W. de Barker. The fixed point approach in semantics: theory and applications. Foundations of computer science, edited by J. W. de Bakker, Mathematical Centre Tracts 63, Mathematisch Centrum, Amsterdam1975, pp. 1–53. [REVIEW]Andrzej Blikle - 1977 - Journal of Symbolic Logic 42 (3):419-420.
  4.  7
    Review: J. W. de Bakker, The Fixed Point Approach in Semantics: Theory and Applications. [REVIEW]Andrzej Blikle - 1977 - Journal of Symbolic Logic 42 (3):419-420.
  5. A universal approach to self-referential paradoxes, incompleteness and fixed points.Noson S. Yanofsky - 2003 - Bulletin of Symbolic Logic 9 (3):362-386.
    Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses the semantic paradoxes, and how they arise as diagonal arguments and fixed point theorems in logic, computability theory, complexity theory and formal language theory.
    Direct download (13 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  6. The fixed point non-classical theory of truth value gaps by S. Kripke.Artyom Ukhov - 2017 - Vestnik SPbSU. Philosophy and Conflict Studies 33 (2):224-233.
    The article is about one of the vital problem for analytic philosophy which is how to define truth value for sentences which include their own truth predicate. The aim of the article is to determine Saul Kripke’s approach to widen epistemological truth to create a systemic model of truth. Despite a lot of work on the subject, the theme of truth is no less relevant to modern philosophy. With the help of S. Kripke’s article “Outline of the Theory of (...)
     
    Export citation  
     
    Bookmark  
  7.  20
    Iterating Fixed Point via Generalized Mann’s Iteration in Convex b-Metric Spaces with Application.A. Asif, M. Alansari, N. Hussain, M. Arshad & A. Ali - 2021 - Complexity 2021:1-12.
    This manuscript investigates fixed point of single-valued Hardy-Roger’s type F -contraction globally as well as locally in a convex b -metric space. The paper, using generalized Mann’s iteration, iterates fixed point of the abovementioned contraction; however, the third axiom of the F -contraction is removed, and thus the mapping F is relaxed. An important approach used in the article is, though a subset closed ball of a complete convex b -metric space is not necessarily complete, the convergence of the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  17
    Non-strictly positive fixed points for classical natural deduction.Ralph Matthes - 2005 - Annals of Pure and Applied Logic 133 (1):205-230.
    Termination for classical natural deduction is difficult in the presence of commuting/permutative conversions for disjunction. An approach based on reducibility candidates is presented that uses non-strictly positive inductive definitions.It covers second-order universal quantification and also the extension of the logic with fixed points of non-strictly positive operators, which appears to be a new result.Finally, the relation to Parigot’s strictly positive inductive definition of his set of reducibility candidates and to his notion of generalized reducibility candidates is explained.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  9.  40
    Comparing More Revision and Fixed-Point Theories of Truth.Qiqing Lin & Hu Liu - 2021 - Journal of Philosophical Logic 50 (4):615-671.
    Kremer presented three approaches of comparing fixed-point and revision theories of truth in Kremer, 363–403, 2009). Using these approaches, he established the relationships among ten fixed-point theories suggested by Kripke in, 690–716, 1975) and three revision theories presented by Gupta and Belnap in. This paper continues Kremer’s work. We add five other revision theories to the comparisons, including the theory proposed by Gupta in, 1–60, 1982), the theory proposed by Herzberger in, 61–102, 1982), the theory based on fully-varied revision sequences (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  10
    An intensional fixed point theory over first order arithmetic.Gerhard Jäger - 2004 - Annals of Pure and Applied Logic 128 (1-3):197-213.
    The purpose of this article is to present a new theory for fixed points over arithmetic which allows the building up of fixed points in a very nested and entangled way. But in spite of its great expressive power we can show that the proof-theoretic strength of our theory—which is intensional in a meaning to be described below—is characterized by the Feferman–Schütte ordinal Γ0. Our approach is similar to the building up of fixed points over state spaces in the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  56
    Tarski's fixed-point theorem and lambda calculi with monotone inductive types.Ralph Matthes - 2002 - Synthese 133 (1-2):107 - 129.
    The new concept of lambda calculi with monotone inductive types is introduced byhelp of motivations drawn from Tarski's fixed-point theorem (in preorder theory) andinitial algebras and initial recursive algebras from category theory. They are intendedto serve as formalisms for studying iteration and primitive recursion ongeneral inductively given structures. Special accent is put on the behaviour ofthe rewrite rules motivated by the categorical approach, most notably on thequestion of strong normalization (i.e., the impossibility of an infinitesequence of successive rewrite steps). (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  12.  37
    Embracing intensionality: Paradoxicality and semi-truth operators in fixed point models.Nicholas Tourville & Roy T. Cook - 2020 - Logic Journal of the IGPL 28 (5):747-770.
    The Embracing Revenge account of semantic paradox avoids the expressive limitations of previous approaches based on the Kripkean fixed point construction by replacing a single language with an indefinitely extensible sequence of languages, each of which contains the resources to fully characterize the semantics of the previous languages. In this paper we extend the account developed in Cook, Cook, Schlenker, and Tourville and Cook via the addition of intensional operators such as ``is paradoxical''. In this extended framework we are able (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  13.  69
    A Buchholz Rule for Modal Fixed Point Logics.Gerhard Jäger & Thomas Studer - 2011 - Logica Universalis 5 (1):1-19.
    Buchholz’s Ω μ+1-rules provide a major tool for the proof-theoretic analysis of arithmetical inductive definitions. The aim of this paper is to put this approach into the new context of modal fixed point logic. We introduce a deductive system based on an Ω-rule tailored for modal fixed point logic and develop the basic techniques for establishing soundness and completeness of the corresponding system. In the concluding section we prove a cut elimination and collapsing result similar to that of Buchholz (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14. Achieving Goals and Making Meanings: Toward a Unified Model of Recreational Experience.Peter J. Fix, J. Brooks, Jeffrey & M. Harrington, Andrew - 2018 - Journal of Outdoor Recreation and Tourism 23:16-25.
    Understanding recreational experiences is a longstanding research tradition and key to effective management. Given the complexities of human experience, many approaches have been applied to study recreational experience. Two such approaches are the experiential approach (based in a positivistic paradigm) and emergent experience (based in an interpretive paradigm). While viewed as being complementary, researchers have not offered guidance for incorporating the approaches into a common model of recreational experience. This study utilized longitudinal, qualitative data to examine aspects of recreational (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  19
    Ultraproducts and Chevalley groups.Françoise Point - 1999 - Archive for Mathematical Logic 38 (6):355-372.
    Given a simple non-trivial finite-dimensional Lie algebra L, fields $K_i$ and Chevalley groups $L(K_i)$ , we first prove that $\Pi_{\mathcal{U}} L(K_i)$ is isomorphic to $L(\Pi_{\mathcal{U}}K_i)$ . Then we consider the case of Chevalley groups of twisted type ${}^n\!L$ . We obtain a result analogous to the previous one. Given perfect fields $K_i$ having the property that any element is either a square or the opposite of a square and Chevalley groups ${}^n\!L(K_i)$ , then $\pu{}^n\!L(K_i)$ is isomorphic to ${}^n\!L(\pu K_i)$ . (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16.  23
    Asymptotic theory of modules of separably closed fields.Françoise Point - 2005 - Journal of Symbolic Logic 70 (2):573-592.
    We consider the reduct to the module language of certain theories of fields with a non surjective endomorphism. We show in some cases the existence of a model companion. We apply our results for axiomatizing the reduct to the theory of modules of non principal ultraproducts of separably closed fields of fixed but non zero imperfection degree.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  17.  5
    La Philosophie pour enfants : une piste pour réconcilier enseignement disciplinaire et vie scolaire?Christophe Point - 2021 - Studia Universitatis Babeş-Bolyai Philosophia 66 (1):163-177.
    "Philosophy for Children: a Way to Reconcile Disciplinary Teaching and School Life? Drawing mainly on John Dewey's writings, this contribution aims to extend the dualism of a traditional conception of education at the epistemological, pedagogical and organizational levels. This conception was already criticised by this author at the beginning of the 20th century and still remains widely present today among the school community. Through this approach, we demonstrate that the dualist approach is as many obstacles to be removed (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  75
    The theory of modules of separably closed fields. I.Pilar Dellunde, Françoise Delon & Françoise Point - 2002 - Journal of Symbolic Logic 67 (3):997-1015.
    We consider separably closed fields of characteristic $p > 0$ and fixed imperfection degree as modules over a skew polynomial ring. We axiomatize the corresponding theory and we show that it is complete and that it admits quantifier elimination in the usual module language augmented with additive functions which are the analog of the $p$-component functions.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  19.  5
    Peer Commentary and Responses.Six Points To Ponder - 1999 - In Jonathan Shear & Francisco J. Varela (eds.), The view from within: first-person approaches to the study of consciousness. Bowling Green, OH: Imprint Academic. pp. 213-311.
    Direct download  
     
    Export citation  
     
    Bookmark  
  20.  42
    A Topological Approach to Yablo's Paradox.Claudio Bernardi - 2009 - Notre Dame Journal of Formal Logic 50 (3):331-338.
    Some years ago, Yablo gave a paradox concerning an infinite sequence of sentences: if each sentence of the sequence is 'every subsequent sentence in the sequence is false', a contradiction easily follows. In this paper we suggest a formalization of Yablo's paradox in algebraic and topological terms. Our main theorem states that, under a suitable condition, any continuous function from 2N to 2N has a fixed point. This can be translated in the original framework as follows. Consider an infinite sequence (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  15
    Fixing Education.John E. Petrovic & Aaron M. Kuntz - 2017 - Studies in Philosophy and Education 37 (1):65-80.
    In this article we consider the material dimensions of schooling as constitutive of the possibilities inherent in “fixing” education. We begin by mapping out the problem of “fixing education,” pointing to the necrophilic tendencies of contemporary education—a desire to kill what otherwise might be life-giving. In this sense, to “fix” education is to make otherwise fluid processes-of-living static. We next point to the material realities of this move to fix. After establishing the material consequences of perpetually fixing schools, we provide (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  27
    Fixing Education.Aaron M. Kuntz & John E. Petrovic - 2017 - Studies in Philosophy and Education 37 (1):65-80.
    In this article we consider the material dimensions of schooling as constitutive of the possibilities inherent in “fixing” education. We begin by mapping out the problem of “fixing education,” pointing to the necrophilic tendencies of contemporary education—a desire to kill what otherwise might be life-giving. In this sense, to “fix” education is to make otherwise fluid processes-of-living static. We next point to the material realities of this move to fix. After establishing the material consequences of perpetually fixing schools, we provide (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23.  45
    The Structural Collapse Approach Reconsidered.Ignacio Ojea - 2012 - Análisis Filosófico 32 (1):61-68.
    I will argue that Roy Cook’s (forthcoming) reformulation of Yablo’s Paradox in the infinitary system D is a genuinely non-circular paradox, but for different reasons than the ones he sustained. In fact, the first part of the job will be to show that his argument regarding the absence of fixed points in the construction is insufficient to prove the noncircularity of it; at much it proves its non-self referentiality. The second is to reconsider the structural collapse approach Cook rejects, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  21
    Turning points and the ‘everyday’: Exploring agency and violence in intimate relationships.Christa Binswanger, Suruchi Thapar-Björkert & Lotta Samelius - 2014 - European Journal of Women's Studies 21 (3):264-277.
    In this article the authors1 approach material and symbolic violence through transdisciplinary readings of theoretical debates, fiction and empirical narratives. They make use of the concept of turning points which disrupt dichotomous and static categorizations of victim and survivor, and their association with passivity and agency respectively. In situations of violence, turning points represent temporality instead of timelessness, dialogism instead of monologism, multilayering rather than any fixed identity. The authors draw on the theorists Bakhtin and Certeau, whose work highlights (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  25. Artificial Intelligence Is Stupid and Causal Reasoning Will Not Fix It.J. Mark Bishop - 2021 - Frontiers in Psychology 11.
    Artificial Neural Networks have reached “grandmaster” and even “super-human” performance across a variety of games, from those involving perfect information, such as Go, to those involving imperfect information, such as “Starcraft”. Such technological developments from artificial intelligence (AI) labs have ushered concomitant applications across the world of business, where an “AI” brand-tag is quickly becoming ubiquitous. A corollary of such widespread commercial deployment is that when AI gets things wrong—an autonomous vehicle crashes, a chatbot exhibits “racist” behavior, automated credit-scoring processes (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  26. Comparing fixed-point and revision theories of truth.Philip Kremer - 2009 - Journal of Philosophical Logic 38 (4):363-403.
    In response to the liar’s paradox, Kripke developed the fixed-point semantics for languages expressing their own truth concepts. Kripke’s work suggests a number of related fixed-point theories of truth for such languages. Gupta and Belnap develop their revision theory of truth in contrast to the fixed-point theories. The current paper considers three natural ways to compare the various resulting theories of truth, and establishes the resulting relationships among these theories. The point is to get a sense of the lay of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  27.  11
    Approaching History through the Future: Some Thoughts from a Feminist Pragmatist.Erin McKenna - 2022 - The Pluralist 17 (3):71-80.
    In lieu of an abstract, here is a brief excerpt of the content:Approaching History through the Future: Some Thoughts from a Feminist PragmatistErin McKennai was recently asked to write on the philosophy of history from a pragmatist perspective. My initial response was that this is not my area of specialization and that I didn’t really have much to say. Then I realized that it was interesting to think about how I view and use notions of history in my work as (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28. How Reductive Analyses of Content are Confused and How to Fix Them: A Critique of Varitel Semantics.Nancy Salay - 2021 - Journal of Mind and Behavior 42 (2):109-138.
    The “problem of intentionality” from the vantage point of a representational understanding of mind is explaining what thoughts and beliefs are and how they guide behaviour. From an anti-representationalist perspective, on the other hand, on which cognition itself is taken to be a kind of action, intentionality is a capacity to engage in behaviour that is meaningfully directed toward or about some situation. That these are not in fact competing insights is obscured by the representational/anti-representational framing of the debate. This (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  64
    Self-Concern: An Experiential Approach to What Matters in Survival.Raymond Martin - 1997 - New York, NY, USA: Cambridge University Press.
    This book is a major contribution to the philosophical literature on the nature of the self, personal identity and survival. Its distinctive methodology is one that is phenomenologically descriptive rather than metaphysical and normative. On the basis of this approach Raymond Martin shows that the distinction between self and other is not nearly as fundamental a feature of our so-called egoistic values as has been traditionally thought. He explains how the belief in a self as a fixed, continuous point (...)
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  30. Supervaluation fixed-point logics of truth.Philip Kremer & Alasdair Urquhart - 2008 - Journal of Philosophical Logic 37 (5):407-440.
    Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixed-point logic of truth and the weak Kleene fixed-point logic of truth, but leaves the axiomatizability question open for the supervaluation fixed-point logic of truth and its variants. We show that the principal supervaluation fixed point logic of truth, when thought of as consequence relation, is highly complex: it is not even analytic. We also (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  31
    Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
    Jäger, G., Fixed points in Peano arithmetic with ordinals, Annals of Pure and Applied Logic 60 119-132. This paper deals with some proof-theoretic aspects of fixed point theories over Peano arithmetic with ordinals. It studies three such theories which differ in the principles which are available for induction on the natural numbers and ordinals. The main result states that there is a natural theory in this framework which is a conservative extension of Peano arithmeti.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  32.  20
    Fixed-points of Set-continuous Operators.O. Esser, R. Hinnion & D. Dzierzgowski - 2000 - Mathematical Logic Quarterly 46 (2):183-194.
    In this paper, we study when a set-continuous operator has a fixed-point that is the intersection of a directed family. The framework of our study is the Kelley-Morse theory KMC– and the Gödel-Bernays theory GBC–, both theories including an Axiom of Choice and excluding the Axiom of Foundation. On the one hand, we prove a result concerning monotone operators in KMC– that cannot be proved in GBC–. On the other hand, we study conditions on directed superclasses in GBC– in order (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  29
    Intuitionistic Fixed Point Theories for Strictly Positive Operators.Christian Rüede & Thomas Strahm - 2002 - Mathematical Logic Quarterly 48 (2):195-202.
    In this paper it is shown that the intuitionistic .xed point theory equation image for α times iterated fixed points of strictly positive operator forms is conservative for negative arithmetic and equation image sentences over the theory equation image for α times iterated arithmetic comprehension without set parameters.This generalizes results previously due to Buchholz [5] and Arai [2].
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  22
    The fixed points of belief and knowledge.Daniela Schuster - forthcoming - Logic Journal of the IGPL.
    Self-referential sentences have troubled our understanding of language for centuries. The most famous self-referential sentence is probably the Liar, a sentence that says of itself that it is false. The Liar Paradox has encouraged many philosophers to establish theories of truth that manage to give a proper account of the truth predicate in a formal language. Kripke’s Fixed Point Theory from 1975 is one famous example of such a formal theory of truth that aims at giving a plausible notion of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  17
    Fixed point theorems for precomplete numberings.Henk Barendregt & Sebastiaan A. Terwijn - 2019 - Annals of Pure and Applied Logic 170 (10):1151-1161.
    In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness criterion also holds for every precomplete numbering, and we discuss the relation with Visser's ADN theorem, as well as the uniformity or nonuniformity of the various fixed point theorems. Finally, we base numberings on partial combinatory algebras and prove a generalization of Ershov's theorem in this context.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  36.  23
    Explicit Fixed Points in Interpretability Logic.Dick de Jongh & Albert Visser - 1991 - Studia Logica 50 (1):39-49.
    The problem of Uniqueness and Explicit Definability of Fixed Points for Interpretability Logic is considered. It turns out that Uniqueness is an immediate corollary of a theorem of Smoryński.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  37.  15
    Flows into inflation: An effective field theory approach.Feraz Azhar & David I. Kaiser - 2018 - Physical Review D 98 (6).
    We analyze the flow into inflation for generic "single-clock" systems, by combining an effective field theory approach with a dynamical-systems analysis. In this approach, we construct an expansion for the potential-like term in the effective action as a function of time, rather than specifying a particular functional dependence on a scalar field. We may then identify fixed points in the effective phase space for such systems, order-by-order, as various constraints are placed on the Mth time derivative of the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  87
    Moral Fixed Points, Rationality and the ‘Why Be Moral?’ Question.Christos Kyriacou - 2019 - Erkenntnis 86 (3):647-664.
    Cuneo and Shafer-Landau have argued that there are moral conceptual truths that are substantive and non-vacuous in content, what they called ‘moral fixed points’. If the moral proposition ‘torturing kids for fun is pro tanto wrong’ is such a conceptual truth, it is because the essence of ‘wrong’ necessarily satisfies and applies to the substantive content of ‘torturing kids for fun’. In critique, Killoren :165–173, 2016) has revisited the old skeptical ‘why be moral?’ question and argued that the moral fixed (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  39. Structural fixed-point theorems.Brian Rabern & Landon Rabern - manuscript
    The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality -- these are the so-called "dangerous" directed graphs. Building on Rabern, et. al (2013) we reformulate this problem in terms of fixed points of certain functions, thereby boiling it down to get (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Rationality’s Fixed Point.Michael G. Titelbaum - 2015 - Oxford Studies in Epistemology 5.
    This article defends the Fixed Point Thesis: that it is always a rational mistake to have false beliefs about the requirements of rationality. The Fixed Point Thesis is inspired by logical omniscience requirements in formal epistemology. It argues to the Fixed Point Thesis from the Akratic Principle: that rationality forbids having an attitude while believing that attitude is rationally forbidden. It then draws out surprising consequences of the Fixed Point Thesis, for instance that certain kinds of a priori justification are (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   179 citations  
  41.  68
    A fixed point theorem for the weak Kleene valuation scheme.Anil Gupta & Robert L. Martin - 1984 - Journal of Philosophical Logic 13 (2):131 - 135.
  42.  21
    A fixed-point problem for theories of meaning.Niklas Dahl - 2022 - Synthese 200 (1):1-15.
    In this paper I argue that it’s impossible for there to be a single universal theory of meaning for a language. First, I will consider some minimal expressiveness requirements a language must meet to be able to express semantic claims. Then I will argue that in order to have a single unified theory of meaning, these expressiveness requirements must be satisfied by a language which the semantic theory itself applies to. That is, we would need a language which can express (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  49
    Fixed point logics.Anuj Dawar & Yuri Gurevich - 2002 - Bulletin of Symbolic Logic 8 (1):65-88.
    We consider fixed point logics, i.e., extensions of first order predicate logic with operators defining fixed points. A number of such operators, generalizing inductive definitions, have been studied in the context of finite model theory, including nondeterministic and alternating operators. We review results established in finite model theory, and also consider the expressive power of the resulting logics on infinite structures. In particular, we establish the relationship between inflationary and nondeterministic fixed point logics and second order logic, and we consider (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  44.  34
    The Fixed Point Property in Modal Logic.Lorenzo Sacchetti - 2001 - Notre Dame Journal of Formal Logic 42 (2):65-86.
    This paper deals with the modal logics associated with (possibly nonstandard) provability predicates of Peano Arithmetic. One of our goals is to present some modal systems having the fixed point property and not extending the Gödel-Löb system GL. We prove that, for every has the explicit fixed point property. Our main result states that every complete modal logic L having the Craig's interpolation property and such that , where and are suitable modal formulas, has the explicit fixed point property.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  61
    Explicit fixed points in interpretability logic.Dick Jongh & Albert Visser - 1991 - Studia Logica 50 (1):39 - 49.
    The problem of Uniqueness and Explicit Definability of Fixed Points for Interpretability Logic is considered. It turns out that Uniqueness is an immediate corollary of a theorem of Smoryski.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  46.  93
    Fixed-point solutions to the regress problem in normative uncertainty.Philip Trammell - 2019 - Synthese 198 (2):1177-1199.
    When we are faced with a choice among acts, but are uncertain about the true state of the world, we may be uncertain about the acts’ “choiceworthiness”. Decision theories guide our choice by making normative claims about how we should respond to this uncertainty. If we are unsure which decision theory is correct, however, we may remain unsure of what we ought to do. Given this decision-theoretic uncertainty, meta-theories attempt to resolve the conflicts between our decision theories...but we may be (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  47.  18
    Largest fixed points of set continuous operators and Boffa's Anti-Foundation.Hisato Muraki - 2005 - Mathematical Logic Quarterly 51 (4):365.
    In Aczel [1], the existence of largest fixed points of set continuous operators is proved assuming the schema version of dependent choices in Zermelo-Fraenkel set theory without the axiom of Foundation. In the present paper, we study whether the existence of largest fixed points of set continuous operators is provable without the schema version of dependent choices, using Boffa's weak antifoundation axioms.
    Direct download  
     
    Export citation  
     
    Bookmark  
  48.  23
    A fixed point theorem for o-minimal structures.Kam-Chau Wong - 2003 - Mathematical Logic Quarterly 49 (6):598.
    We prove a definable analogue to Brouwer's Fixed Point Theorem for o-minimal structures of real closed field expansions: A continuous definable function mapping from the unit simplex into itself admits a fixed point, even though the underlying space is not necessarily topologically complete. Our proof is direct and elementary; it uses a triangulation technique for o-minimal functions, with an application of Sperner's Lemma.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  44
    The fixed-point theorem for diagonalizable algebras.Claudio Bernardi - 1975 - Studia Logica 34 (3):239 - 251.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  50.  40
    Fixed-point extensions of first-order logic.Yuri Gurevich & Saharon Shelah - 1986 - Annals of Pure and Applied Logic 32:265-280.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   21 citations  
1 — 50 / 999