Results for 'Transfinite recursion'

183 found
Order:
  1. Eliminating the ordinals from proofs. An analysis of transfinite recursion.Edoardo Rivello - 2014 - In Proceedings of the conference "Philosophy, Mathematics, Linguistics. Aspects of Interaction", St. Petersburg, April 21-25, 2014. pp. 174-184.
    Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. A mathematically derived definitional/semantical theory of truth.Seppo Heikkilä - 2018 - Nonlinear Studies 25 (1):173-189.
    Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation. This interpretation is equivalent to the interpretation by meanings of sentences if the object language is so interpreted. The added formula provides a truth predicate for the constructed language. The so obtained theory of truth satisfies the norms presented in Hannes Leitgeb's (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. A Mathematical Model of Divine Infinity.Eric Steinhart - 2009 - Theology and Science 7 (3):261-274.
    Mathematics is obviously important in the sciences. And so it is likely to be equally important in any effort that aims to understand God in a scientifically significant way or that aims to clarify the relations between science and theology. The degree to which God has any perfection is absolutely infinite. We use contemporary mathematics to precisely define that absolute infinity. For any perfection, we use transfinite recursion to define an endlessly ascending series of degrees of that perfection. (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  4. Why Numbers Are Sets.Eric Steinhart - 2002 - Synthese 133 (3):343-361.
    I follow standard mathematical practice and theory to argue that the natural numbers are the finite von Neumann ordinals. I present the reasons standardly given for identifying the natural numbers with the finite von Neumann's (e.g., recursiveness; well-ordering principles; continuity at transfinite limits; minimality; and identification of n with the set of all numbers less than n). I give a detailed mathematical demonstration that 0 is { } and for every natural number n, n is the set of all (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  5. Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  6. Transfinite Number in Wittgenstein's Tractatus.James R. Connelly - 2021 - Journal for the History of Analytical Philosophy 9 (2).
    In his highly perceptive, if underappreciated introduction to Wittgenstein’s Tractatus, Russell identifies a “lacuna” within Wittgenstein’s theory of number, relating specifically to the topic of transfinite number. The goal of this paper is two-fold. The first is to show that Russell’s concerns cannot be dismissed on the grounds that they are external to the Tractarian project, deriving, perhaps, from logicist ambitions harbored by Russell but not shared by Wittgenstein. The extensibility of Wittgenstein’s theory of number to the case of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. Transfinitely Transitive Value.Kacper Kowalczyk - 2021 - Philosophical Quarterly 72 (1):108-134.
    This paper develops transfinite extensions of transitivity and acyclicity in the context of population ethics. They are used to argue that it is better to add good lives, worse to add bad lives, and equally good to add neutral lives, where a life's value is understood as personal value. These conclusions rule out a number of theories of population ethics, feed into an argument for the repugnant conclusion, and allow us to reduce different-number comparisons to same-number ones. Challenges to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Natural Recursion Doesn’t Work That Way: Automata in Planning and Syntax.Cem Bozsahin - 2016 - In Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence. Cham: Springer. pp. 95-112.
    Natural recursion in syntax is recursion by linguistic value, which is not syntactic in nature but semantic. Syntax-specific recursion is not recursion by name as the term is understood in theoretical computer science. Recursion by name is probably not natural because of its infinite typeability. Natural recursion, or recursion by value, is not species-specific. Human recursion is not syntax-specific. The values on which it operates are most likely domain-specific, including those for syntax. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Inverse Operations with Transfinite Numbers and the Kalam Cosmological Argument.Graham Oppy - 1995 - International Philosophical Quarterly 35 (2):219-221.
    William Lane Craig has argued that there cannot be actual infinities because inverse operations are not well-defined for infinities. I point out that, in fact, there are mathematical systems in which inverse operations for infinities are well-defined. In particular, the theory introduced in John Conway's *On Numbers and Games* yields a well-defined field that includes all of Cantor's transfinite numbers.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  10. Recursive predicates and quantifiers.S. C. Kleene - 1943 - Transactions of the American Mathematical Society 53:41-73.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  11. The construction of transfinite equivalence algorithms.Han Geurdes - manuscript
    Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. Jumping through the transfinite: The master code hierarchy of Turing degrees.Harold T. Hodes - 1980 - Journal of Symbolic Logic 45 (2):204-220.
    Where $\underline{a}$ is a Turing degree and ξ is an ordinal $ , the result of performing ξ jumps on $\underline{a},\underline{a}^{(\xi)}$ , is defined set-theoretically, using Jensen's fine-structure results. This operation appears to be the natural extension through $(\aleph_1)^{L^\underline{a}}$ of the ordinary jump operations. We describe this operation in more degree-theoretic terms, examine how much of it could be defined in degree-theoretic terms and compare it to the single jump operation.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  13. Consciousness as Recursive, Spatiotemporal Self Location.Frederic Peters - 2010 - Psychological Research.
    At the phenomenal level, consciousness can be described as a singular, unified field of recursive self-awareness, consistently coherent in a particualr way; that of a subject located both spatially and temporally in an egocentrically-extended domain, such that conscious self-awareness is explicitly characterized by I-ness, now-ness and here-ness. The psychological mechanism underwriting this spatiotemporal self-locatedness and its recursive processing style involves an evolutionary elaboration of the basic orientative reference frame which consistently structures ongoing spatiotemporal self-location computations as i-here-now. Cognition computes action-output (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  14. Responsibility and the recursion problem.Ben Davies - 2021 - Ratio 35 (2):112-122.
    A considerable literature has emerged around the idea of using ‘personal responsibility’ as an allocation criterion in healthcare distribution, where a person's being suitably responsible for their health needs may justify additional conditions on receiving healthcare, and perhaps even limiting access entirely, sometimes known as ‘responsibilisation’. This discussion focuses most prominently, but not exclusively, on ‘luck egalitarianism’, the view that deviations from equality are justified only by suitably free choices. A superficially separate issue in distributive justice concerns the two–way relationship (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  15. What is Radical Recursion?Steven M. Rosen - 2004 - SEED Journal 4 (1):38-57.
    Recursion or self-reference is a key feature of contemporary research and writing in semiotics. The paper begins by focusing on the role of recursion in poststructuralism. It is suggested that much of what passes for recursion in this field is in fact not recursive all the way down. After the paradoxical meaning of radical recursion is adumbrated, topology is employed to provide some examples. The properties of the Moebius strip prove helpful in bringing out the dialectical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Philosophy and Science, the Darwinian-Evolved Computational Brain, a Non-Recursive Super-Turing Machine & Our Inner-World-Producing Organ.Hermann G. W. Burchard - 2016 - Open Journal of Philosophy 6 (1):13-28.
    Recent advances in neuroscience lead to a wider realm for philosophy to include the science of the Darwinian-evolved computational brain, our inner world producing organ, a non-recursive super- Turing machine combining 100B synapsing-neuron DNA-computers based on the genetic code. The whole system is a logos machine offering a world map for global context, essential for our intentional grasp of opportunities. We start from the observable contrast between the chaotic universe vs. our orderly inner world, the noumenal cosmos. So far, philosophy (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  17. On Rudimentarity, Primitive Recursivity and Representability.Saeed Salehi - 2020 - Reports on Mathematical Logic 55:73–85.
    It is quite well-known from Kurt G¨odel’s (1931) ground-breaking Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are representable in sufficiently strong arithmetical theories. It is also known, though perhaps not as well-known as the former one, that some primitive recursive relations are not rudimentary. We present a simple and elementary proof of this fact in the first part of the paper. In the second part, we review some possible (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. Ortega y Gasset on Georg Cantor’s Theory of Transfinite Numbers.Lior Rabi - 2016 - Kairos (15):46-70.
    Ortega y Gasset is known for his philosophy of life and his effort to propose an alternative to both realism and idealism. The goal of this article is to focus on an unfamiliar aspect of his thought. The focus will be given to Ortega’s interpretation of the advancements in modern mathematics in general and Cantor’s theory of transfinite numbers in particular. The main argument is that Ortega acknowledged the historical importance of the Cantor’s Set Theory, analyzed it and articulated (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. Puzzles for Recursive Reliabilism.Shun Iizuka - 2022 - Review of Analytic Philosophy 2 (1):55-73.
    The recursive aspect of process reliabilism has rarely been examined. The regress puzzle, which illustrates infinite regress arising from the combination of the recursive structure and the no-defeater condition incorporated into it, is a valuable exception. However, this puzzle can be dealt with in the framework of process reliabilism by reconsidering the relationship between the recursion and the no-defeater condition based on the distinction between prima facie and ultima facie justification. Thus, the regress puzzle is not a basis for (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. A sharper image: the quest of science and recursive production of objective realities.Julio Michael Stern - 2020 - Principia: An International Journal of Epistemology 24 (2):255-297.
    This article explores the metaphor of Science as provider of sharp images of our environment, using the epistemological framework of Objective Cognitive Constructivism. These sharp images are conveyed by precise scientific hypotheses that, in turn, are encoded by mathematical equations. Furthermore, this article describes how such knowledge is pro-duced by a cyclic and recursive development, perfection and reinforcement process, leading to the emergence of eigen-solutions characterized by the four essential properties of precision, stability, separability and composability. Finally, this article discusses (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  21. The God-given Naturals, Induction and Recursion.Paulo Veloso & André Porto - 2021 - O Que Nos Faz Pensar 29 (49):115-156.
    We discuss some basic issues underlying the natural numbers: induction and recursion. We examine recursive formulations and their use in establishing universal and particular properties.
    Download  
     
    Export citation  
     
    Bookmark  
  22. Retrieving the Mathematical Mission of the Continuum Concept from the Transfinitely Reductionist Debris of Cantor’s Paradise. Extended Abstract.Edward G. Belaga - forthcoming - International Journal of Pure and Applied Mathematics.
    What is so special and mysterious about the Continuum, this ancient, always topical, and alongside the concept of integers, most intuitively transparent and omnipresent conceptual and formal medium for mathematical constructions and the battle field of mathematical inquiries ? And why it resists the century long siege by best mathematical minds of all times committed to penetrate once and for all its set-theoretical enigma ? -/- The double-edged purpose of the present study is to save from the transfinite deadlock (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23.  98
    The Unusual Logic of Hurka's Recursive Account.Avram Hiller - 2012 - Journal of Ethics and Social Philosophy 6 (1):1-6.
    Thomas Hurka, in his book Virtue, Vice, and Value, and elsewhere, develops a recursive analysis of higher-order pleasures and pains. The account leads Hurka to some potentially controversial conclusions. For instance, Hurka argues on its basis that some states are both good and evil and also that the view he calls the conditionality view is false. In this paper, I argue that Hurka’s formulation of the recursive account is unusual and inelegant, and that Hurka reaches his conclusions only because of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Contradiction and Recursion in Buddhist Philosophy.Adrian Kreutz - 2019 - In Takeshi Morisato & Roman Pașca (eds.), Asian Philosophical Texts Vol. 1. Milano: Mimesis International. pp. 133-162.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25. Wittgenstein And Labyrinth Of ‘Actual Infinity’: The Critique Of Transfinite Set Theory.Valérie Lynn Therrien - 2012 - Ithaque 10:43-65.
    In order to explain Wittgenstein’s account of the reality of completed infinity in mathematics, a brief overview of Cantor’s initial injection of the idea into set- theory, its trajectory and the philosophic implications he attributed to it will be presented. Subsequently, we will first expound Wittgenstein’s grammatical critique of the use of the term ‘infinity’ in common parlance and its conversion into a notion of an actually existing infinite ‘set’. Secondly, we will delve into Wittgenstein’s technical critique of the concept (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  26. "The Choreography of the Soul": Recursive Patterns in Psychology, Political Anthropology and Cosmology.Edward D'angelo - 1988 - Dissertation, State University of New York at Stony Brook
    The component structures of two distinct neuropsychological systems are described. "System-Y" depends upon "system-X" which, on the other hand, can operate independently of system-Y. System-X provides a matrix upon which system-Y must operate, and, system-Y is transformed by the operations of system-X. In addition these neuropsychological structures reverberate in political history and in the cosmos. The most fundamental structure in the soul, in society, and in the cosmos, has the form of a conical spiral. It can be described mathematically as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA.Willem Conradie, Valentin Goranko & Dimitar Vakarelov - 2010 - Journal of Applied Logic 8 (4):319-333.
    The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we prove that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  28. Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic.Saeed Salehi - 2002 - Reports on Mathematical Logic 36 (1):55-61.
    By formalizing some classical facts about provably total functions of intuitionistic primitive recursive arithmetic (iPRA), we prove that the set of decidable formulas of iPRA and of iΣ1+ (intuitionistic Σ1-induction in the language of PRA) coincides with the set of its provably ∆1-formulas and coincides with the set of its provably atomic formulas. By the same methods, we shall give another proof of a theorem of Marković and De Jongh: the decidable formulas of HA are its provably ∆1-formulas.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  89
    A philosophy of transport: Michel Serres’ recursive epistemology in the Hermes pentalogy.Thomas Sutherland - 2021 - Media Theory 5 (1):201-218.
    Focusing upon the five books of his early Hermes series, this article argues that Michel Serres furnishes an accomplished, unconventional philosophical account of communication and mediation-a structuralist epistemology designed to comprehend the sciences in their complexity and plurality-that, even decades after its first publication, has significant value for media theory. Two key themes within this pentalogy are highlighted: firstly, its emphasis upon motifs of communication, transport, and circulation, attempting to grasp the scientific field in topological terms, as a kind of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. From Analog to Digital Computing: Is Homo sapiens’ Brain on Its Way to Become a Turing Machine?Antoine Danchin & André A. Fenton - 2022 - Frontiers in Ecology and Evolution 10:796413.
    The abstract basis of modern computation is the formal description of a finite state machine, the Universal Turing Machine, based on manipulation of integers and logic symbols. In this contribution to the discourse on the computer-brain analogy, we discuss the extent to which analog computing, as performed by the mammalian brain, is like and unlike the digital computing of Universal Turing Machines. We begin with ordinary reality being a permanent dialog between continuous and discontinuous worlds. So it is with computing, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. Three concepts of decidability for general subsets of uncountable spaces.Matthew W. Parker - 2003 - Theoretical Computer Science 351 (1):2-13.
    There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  32. Halfway Up To the Mathematical Infinity I: On the Ontological & Epistemic Sustainability of Georg Cantor’s Transfinite Design.Edward G. Belaga - manuscript
    Georg Cantor was the genuine discoverer of the Mathematical Infinity, and whatever he claimed, suggested, or even surmised should be taken seriously -- albeit not necessary at its face value. Because alongside his exquisite in beauty ordinal construction and his fundamental powerset description of the continuum, Cantor has also left to us his obsessive presumption that the universe of sets should be subjected to laws similar to those governing the set of natural numbers, including the universal principles of cardinal comparability (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33. Main Concepts in Philosophy of Quantum Information.Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (31):1-4.
    Quantum mechanics involves a generalized form of information, that of quantum information. It is the transfinite generalization of information and re-presentable by transfinite ordinals. The physical world being in the current of time shares the quality of “choice”. Thus quantum information can be seen as the universal substance of the world serving to describe uniformly future, past, and thus the present as the frontier of time. Future is represented as a coherent whole, present as a choice among infinitely (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. Mental Maps1.Ben Blumson - 2011 - Philosophy and Phenomenological Research 85 (2):413-434.
    It's often hypothesized that the structure of mental representation is map-like rather than language-like. The possibility arises as a counterexample to the argument from the best explanation of productivity and systematicity to the language of thought hypothesis—the hypothesis that mental structure is compositional and recursive. In this paper, I argue that the analogy with maps does not undermine the argument, because maps and language have the same kind of compositional and recursive structure.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  35. All science as rigorous science: the principle of constructive mathematizability of any theory.Vasil Penchev - 2020 - Logic and Philosophy of Mathematics eJournal 12 (12):1-15.
    A principle, according to which any scientific theory can be mathematized, is investigated. Social science, liberal arts, history, and philosophy are meant first of all. That kind of theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. Skolem’s “paradox” as logic of ground: The mutual foundation of both proper and improper interpretations.Vasil Penchev - 2020 - Epistemology eJournal (Elsevier: SSRN) 13 (19):1-16.
    A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality. Its investigation needs philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  37. Levels of Self-Improvement in AI and their Implications for AI Safety.Alexey Turchin - manuscript
    Abstract: This article presents a model of self-improving AI in which improvement could happen on several levels: hardware, learning, code and goals system, each of which has several sublevels. We demonstrate that despite diminishing returns at each level and some intrinsic difficulties of recursive self-improvement—like the intelligence-measuring problem, testing problem, parent-child problem and halting risks—even non-recursive self-improvement could produce a mild form of superintelligence by combining small optimizations on different levels and the power of learning. Based on this, we analyze (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. Implications of computer science theory for the simulation hypothesis.David Wolpert - manuscript
    The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation hypothesis. In particular, building on Kleene's second recursion theorem, I (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Incompleteness and Computability: An Open Introduction to Gödel's Theorems.Richard Zach - 2019 - Open Logic Project.
    Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. CORCORAN'S 27 ENTRIES IN THE 1999 SECOND EDITION.John Corcoran - 1999 - In Robert Audi (ed.), The Cambridge Dictionary of Philosophy. CAMBRIDGE UP. pp. 65-941.
    Corcoran’s 27 entries in the 1999 second edition of Robert Audi’s Cambridge Dictionary of Philosophy [Cambridge: Cambridge UP]. -/- ancestral, axiomatic method, borderline case, categoricity, Church (Alonzo), conditional, convention T, converse (outer and inner), corresponding conditional, degenerate case, domain, De Morgan, ellipsis, laws of thought, limiting case, logical form, logical subject, material adequacy, mathematical analysis, omega, proof by recursion, recursive function theory, scheme, scope, Tarski (Alfred), tautology, universe of discourse. -/- The entire work is available online free at more (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  41. From Traditional Set Theory – that of Cantor, Hilbert , Gödel, Cohen – to Its Necessary Quantum Extension.Edward G. Belaga - manuscript
    The original purpose of the present study, 2011, started with a preprint «On the Probable Failure of the Uncountable Power Set Axiom», 1988, is to save from the transfinite deadlock of higher set theory the jewel of mathematical Continuum — this genuine, even if mostly forgotten today raison d’être of all traditional set-theoretical enterprises to Infinity and beyond, from Georg Cantor to David Hilbert to Kurt Gödel to W. Hugh Woodin to Buzz Lightyear.
    Download  
     
    Export citation  
     
    Bookmark  
  42. Brain electrical traits of logical validity.F. Salto - 2021 - Scientific Reports 11 (7892).
    Neuroscience has studied deductive reasoning over the last 20 years under the assumption that deductive inferences are not only de jure but also de facto distinct from other forms of inference. The objective of this research is to verify if logically valid deductions leave any cerebral electrical trait that is distinct from the trait left by non-valid deductions. 23 subjects with an average age of 20.35 years were registered with MEG and placed into a two conditions paradigm (100 trials for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  43. The good of today depends not on the good of tomorrow: a constraint on theories of well-being.Owen C. King - 2020 - Philosophical Studies 177 (8):2365-2380.
    This article addresses three questions about well-being. First, is well-being future-sensitive? I.e., can present well-being depend on future events? Second, is well-being recursively dependent? I.e., can present well-being depend on itself? Third, can present and future well-being be interdependent? The third question combines the first two, in the sense that a yes to it is equivalent to yeses to both the first and second. To do justice to the diverse ways we contemplate well-being, I consider our thought and discourse about (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  44. No successfull infinite regress.Laureano Luna - 2014 - Logic and Logical Philosophy 23 (2):189-201.
    We model infinite regress structures -not arguments- by means of ungrounded recursively defined functions in order to show that no such structure can perform the task of providing determination to the items composing it, that is, that no determination process containing an infinite regress structure is successful.
    Download  
     
    Export citation  
     
    Bookmark  
  45. Actuarial Analysis via Branching Processes.Julio Michael Stern & Carlos Alberto de Braganca Pereira - 2000 - Annals of the 6th ISAS-SCI 8:353-358.
    We describe a software system for the analysis of defined benefit actuarial plans. The system uses a recursive formulation of the actuarial stochastic processes to implement precise and efficient computations of individual and group cash flows.
    Download  
     
    Export citation  
     
    Bookmark  
  46. Říká logicismus něco, co se říkat nemá?Vojtěch Kolman - 2010 - Teorie Vědy / Theory of Science 32 (1):37-57.
    The objective of this paper is to analyze the broader significance of Frege’s logicist project against the background of Wittgenstein’s philosophy from both Tractatus and Philosophical Investigations. The article draws on two basic observations, namely that Frege’s project aims at saying something that was only implicit in everyday arithmetical practice, as the so-called recursion theorem demonstrates, and that the explicitness involved in logicism does not concern the arithmetical operations themselves, but rather the way they are defined. It thus represents (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47. Genetics of Language.Ningombam Bupenda Meitei - 2013 - viXra.Org:7.
    The paper intends to zoom in and find a uniqueness in human language by narrowing down the range of cognitive domains to human computational mind having a property of recursion which is exclusively unique to human and not in any other species in animalia kingdom.This notion of recursion is the centrality of the paper. There has been an opposition to the notion of recursion being only unique to human and the paper makes an attempt to reply to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  48. The Development of Ideas on Computable Intelligence.Yinsheng Zhang - 2017 - Journal of Human Cognition 1 (1):97-108.
    This paper sums up the fundamental features of intelligence through the common features stated by various definitions of "intelligence": Intelligence is the ability of achieving systematic goals (functions) of brain and nerve system through selecting, and artificial intelligence or machine intelligence is an imitation of life intelligence or a replication of features and functions. Based on the definition mentioned above, this paper discusses and summarizes the development routes of ideas on computable intelligence, including Godel's "universal recursive function", the computation activities (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Hilbert's 10th Problem for solutions in a subring of Q.Agnieszka Peszek & Apoloniusz Tyszka - 2019 - Scientific Annals of Computer Science 29 (1):101-111.
    Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. Diagnostic : différends ? Ciel !Jean-Jacques Pinto - 2014 - Ouvertures 2 (octobre 2014):05-40.
    (English then french abstract) -/- This article, which can be read by non-psychoanalysts, intends to browse in four stages through the issue offered to our thinking : two (odd-numbered) stages analyzing the argument that provides its context, and two (even-numbered) of propositions presenting our views on what could be the content of the analytic discourse in the coming years. After this introduction, a first reading will point by point but informally review the argument of J.-P. Journet by showing that each (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 183