Search results for 'Recursion theory' (try it on Scholar)

1000+ found
Sort by:
  1. Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.score: 90.0
    This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Piergiorgio Odifreddi (1989). Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..score: 90.0
    Volume II of Classical Recursion Theory describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, (...)
     
    My bibliography  
     
    Export citation  
  3. S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.score: 87.0
    The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Jens Erik Fenstad, R. O. Gandy & Gerald E. Sacks (eds.) (1978). Generalized Recursion Theory Ii: Proceedings of the 1977 Oslo Symposium. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.score: 78.0
    GENERALIZED RECUBION THEORY II © North-Holland Publishing Company (1978) MONOTONE QUANTIFIERS AND ADMISSIBLE SETS Ion Barwise University of Wisconsin ...
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.score: 76.0
    Machine generated contents note: 1. The Computability Concept;2. General Recursive Functions;3. Programs and Machines;4. Recursive Enumerability;5. Connections to Logic;6. Degrees of Unsolvability;7. Polynomial-Time Computability;Appendix: Mathspeak;Appendix: Countability;Appendix: Decadic Notation;.
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. Anil Nerode & Richard A. Shore (eds.) (1985). Recursion Theory. American Mathematical Society.score: 75.0
    iterations of REA operators, as well as extensions, generalizations and other applications are given in [6] while those for the ...
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..score: 75.0
    Provability, Computability and Reflection.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  8. M. M. Arslanov & Steffen Lempp (eds.) (1999). Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997. W. De Gruyter.score: 75.0
    No categories
     
    My bibliography  
     
    Export citation  
  9. C.-T. Chong (1984). Techniques of Admissible Recursion Theory. Springer-Verlag.score: 75.0
    No categories
     
    My bibliography  
     
    Export citation  
  10. Jens Erik Fenstad (1980). General Recursion Theory: An Axiomatic Approach. Springer-Verlag.score: 75.0
    No categories
     
    My bibliography  
     
    Export citation  
  11. L. L. Ivanov (1986). Algebraic Recursion Theory. Halsted Press.score: 75.0
    No categories
     
    My bibliography  
     
    Export citation  
  12. Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.score: 75.0
    No categories
     
    My bibliography  
     
    Export citation  
  13. Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.score: 63.0
    What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  14. Sy D. Friedman (1983). Some Recent Developments in Higher Recursion Theory. Journal of Symbolic Logic 48 (3):629-642.score: 60.0
    In recent years higher recursion theory has experienced a deep interaction with other areas of logic, particularly set theory (fine structure, forcing, and combinatorics) and infinitary model theory. In this paper we wish to illustrate this interaction by surveying the progress that has been made in two areas: the global theory of the κ-degrees and the study of closure ordinals.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.score: 57.0
    We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms such a theory. We also discuss Hyland's proposal from [4] for a scheme with which to supplement S1-S9, and show that this augmented set of schemes fails to generate countable recursion. We make another proposal to which the methods of this section do not apply.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. John N. Crossley (ed.) (1967). Sets, Models and Recursion Theory. Amsterdam, North-Holland Pub. Co..score: 51.0
    No categories
     
    My bibliography  
     
    Export citation  
  17. Jeremy Avigad (2002). An Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations. Journal of Mathematical Logic 2 (01):91-112.score: 48.0
    The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible set theory with an axiom of infinity. Formalizing the argument provides an (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  18. Robert E. Byerly (1982). Recursion Theory and the Lambda-Calculus. Journal of Symbolic Logic 47 (1):67-83.score: 48.0
    A semantics for the lambda-calculus due to Friedman is used to describe a large and natural class of categorical recursion-theoretic notions. It is shown that if e 1 and e 2 are godel numbers for partial recursive functions in two standard ω-URS's 1 which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e 1 to e 2.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Petr Hájek & Antonín Kučera (1989). On Recursion Theory in I∑. Journal of Symbolic Logic 54 (2):576 - 589.score: 48.0
    It is shown that the low basis theorem is meaningful and provable in I∑ 1 and that the priority-free solution to Post's problem formalizes in this theory.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.score: 46.0
    A type-structure of partial effective functionals over the natural numbers, based on a canonical enumeration of the partial recursive functions, is developed. These partial functionals, defined by a direct elementary technique, turn out to be the computable elements of the hereditary continuous partial objects; moreover, there is a commutative system of enumerations of any given type by any type below (relative numberings). By this and by results in [1] and [2], the Kleene-Kreisel countable functionals and the hereditary effective operations (HEO) (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Robert E. Byerly (1982). An Invariance Notion in Recursion Theory. Journal of Symbolic Logic 47 (1):48-66.score: 46.0
    A set of godel numbers is invariant if it is closed under automorphisms of (ω, ·), where ω is the set of all godel numbers of partial recursive functions and · is application (i.e., n · m ≃ φ n (m)). The invariant arithmetic sets are investigated, and the invariant recursively enumerable sets and partial recursive functions are partially characterized.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Andrew Arana (2004). Arithmetical Independence Results Using Higher Recursion Theory. Journal of Symbolic Logic 69 (1):1-8.score: 45.0
    We extend an independence result proved in our earlier paper "Solovay's Theorem Cannot Be Simplified" (Annals of Pure and Applied Logic 112 (2001)). Our method uses the Barwise.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  23. Carl G. Jockusch Jr (1972). Ramsey's Theorem and Recursion Theory. Journal of Symbolic Logic 37 (2):268-280.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  24. Robert A. Di Paola & Alex Heller (1987). Dominical Categories: Recursion Theory Without Elements. Journal of Symbolic Logic 52 (3):594-635.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. Bruce M. Horowitz (1982). Elementary Formal Systems as a Framework for Relative Recursion Theory. Notre Dame Journal of Formal Logic 23 (1):39-52.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Alex Feldman (1992). Recursion Theory in a Lower Semilattice. Journal of Symbolic Logic 57 (3):892-911.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  27. Johan Moldestad & Dag Normann (1976). Models for Recursion Theory. Journal of Symbolic Logic 41 (4):719-729.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Robert A. Paola & Alex Heller (1987). Dominical Categories: Recursion Theory Without Elements. Journal of Symbolic Logic 52 (3):594 - 635.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. Klaus Ambos-Spies (1984). An Extension of the Nondiamond Theorem in Classical and Α-Recursion Theory. Journal of Symbolic Logic 49 (2):586-607.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Colin G. Bailey (2013). Some Jump-Like Operations in $\Mathbf \Beta $-Recursion Theory. Journal of Symbolic Logic 78 (1):57-71.score: 45.0
  31. E. M. Kleinberg (1970). Recursion Theory and Formal Deducibility. Journal of Symbolic Logic 35 (4):556-558.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  32. Robert S. Lubarsky (1990). An Introduction to Γ-Recursion Theory (or What to Do in KP - Foundation). Journal of Symbolic Logic 55 (1):194-206.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. Wolfgang Maass (1978). The Uniform Regular Set Theorem in Α-Recursion Theory. Journal of Symbolic Logic 43 (2):270-279.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  34. G. Metakides & J. B. Remmel (1979). Recursion Theory on Orderings. I. A Model Theoretic Setting. Journal of Symbolic Logic 44 (3):383-402.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. J. B. Remmel (1980). Recursion Theory on Orderings. II. Journal of Symbolic Logic 45 (2):317-333.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. C. T. Chong (1983). Hyperhypersimple Supersets in Admissible Recursion Theory. Journal of Symbolic Logic 48 (1):185-192.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Thomas J. Grilliot (1972). Omitting Types: Application to Recursion Theory. Journal of Symbolic Logic 37 (1):81-89.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  38. L. A. Harrington & D. B. MacQueen (1976). Selection in Abstract Recursion Theory. Journal of Symbolic Logic 41 (1):153-158.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  39. Raymond M. Smullyan (1994). Diagonalization and Self-Reference. Clarendon Press.score: 45.0
    This book presents a systematic, unified treatment of fixed points as they occur in Godels incompleteness proofs, recursion theory, combinatory logic, semantics, and metamathematics. Packed with instructive problems and solutions, the book offers an excellent introduction to the subject and highlights recent research.
    No categories
     
    My bibliography  
     
    Export citation  
  40. Daniel Dubois (1992). Hyperincursivity: A New Mathematical Theory. Presses Universitaires De Liège.score: 39.0
    No categories
     
    My bibliography  
     
    Export citation  
  41. I͡Uriĭ Leonidovich Ershov (ed.) (1998). Handbook of Recursive Mathematics. Elsevier.score: 39.0
    v. 1. Recursive model theory -- v. 2. Recursive algebra, analysis and combinatorics.
    No categories
     
    My bibliography  
     
    Export citation  
  42. R. L. Goodstein (1961/2010). Recursive Analysis. Dover Publications.score: 39.0
    This graduate-level_text by a master in the field builds a function theory of the rational field that combines aspects of classical and intuitionist analysis. Topics include recursive convergence, recursive and relative continuity, recursive and relative differentiability, the relative integral, elementary functions, and transfinite ordinals. 1961 edition.
     
    My bibliography  
     
    Export citation  
  43. Peter G. Hinman (1978). Recursion-Theoretic Hierarchies. Springer-Verlag.score: 39.0
    No categories
     
    My bibliography  
     
    Export citation  
  44. Marek Karpiński (ed.) (1977). Fundamentals of Computation Theory: Proceedings of the 1977 International Fct-Conference, Poznán-Kórnik, Poland, September 19-23, 1977. [REVIEW] Springer-Verlag.score: 39.0
     
    My bibliography  
     
    Export citation  
  45. Dag Normann (1980). Recursion on the Countable Functionals. Springer-Verlag.score: 39.0
    No categories
     
    My bibliography  
     
    Export citation  
  46. Jeff Edmonds (2008). How to Think About Algorithms. Cambridge University Press.score: 33.0
    There are many algorithm texts that provide lots of well-polished code and proofs of correctness. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author helps students avoid the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. Part of the (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  47. Noam Greenberg (2005). The Role of True Finiteness in the Admissible Recursively Enumerable Degrees. Bulletin of Symbolic Logic 11 (3):398-410.score: 33.0
    We show, however, that this is not always the case.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  48. Peter Dybjer (2000). A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory. Journal of Symbolic Logic 65 (2):525-549.score: 30.0
    The first example of a simultaneous inductive-recursive definition in intuitionistic type theory is Martin-Löf's universe á la Tarski. A set U 0 of codes for small sets is generated inductively at the same time as a function T 0 , which maps a code to the corresponding small set, is defined by recursion on the way the elements of U 0 are generated. In this paper we argue that there is an underlying general notion of simultaneous inductive-recursive definition (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  49. Richard L. Epstein (1981). Initial Segments of Degrees Below 0'. American Mathematical Society.score: 30.0
    MOTIVATION The constructivization of ; => D(_£^') poses several problems. For some of these the tools of MD can be modified; for others new methods will need to be established. What must we do to make a full approximation to ; * D? We ...
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  50. Stephen Cole Kleene, Jon Barwise, H. Jerome Keisler & Kenneth Kunen (eds.) (1980). The Kleene Symposium: Proceedings of the Symposium Held June 18-24, 1978 at Madison, Wisconsin, U.S.A. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.score: 30.0
    No categories
     
    My bibliography  
     
    Export citation  
  51. H. E. Rose (1984). Subrecursion: Functions and Hierarchies. Oxford University Press.score: 30.0
    No categories
     
    My bibliography  
     
    Export citation  
  52. George J. Tourlakis (2003). Lectures in Logic and Set Theory. Cambridge University Press.score: 27.0
    This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume II, on formal (ZFC) set theory, incorporates a self-contained 'chapter 0' on proof (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  53. Solomon Feferman with with R. L. Vaught, Operational Set Theory and Small Large Cardinals.score: 24.0
    “Small” large cardinal notions in the language of ZFC are those large cardinal notions that are consistent with V = L. Besides their original formulation in classical set theory, we have a variety of analogue notions in systems of admissible set theory, admissible recursion theory, constructive set theory, constructive type theory, explicit mathematics and recursive ordinal notations (as used in proof theory). On the face of it, it is surprising that such distinctively set-theoretical (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  54. Michael Rathjen (2006). Theories and Ordinals in Proof Theory. Synthese 148 (3):719 - 743.score: 24.0
    How do ordinals measure the strength and computational power of formal theories? This paper is concerned with the connection between ordinal representation systems and theories established in ordinal analyses. It focusses on results which explain the nature of this connection in terms of semantical and computational notions from model theory, set theory, and generalized recursion theory.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  55. Andrea Cantini (1993). Extending the First-Order Theory of Combinators with Self-Referential Truth. Journal of Symbolic Logic 58 (2):477-513.score: 24.0
    The aim of this paper is to introduce a formal system STW of self-referential truth, which extends the classical first-order theory of pure combinators with a truth predicate and certain approximation axioms. STW naturally embodies the mechanisms of general predicate application/abstraction on a par with function application/abstraction; in addition, it allows non-trivial constructions, inspired by generalized recursion theory. As a consequence, STW provides a smooth inner model for Myhill's systems with levels of implication.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  56. J. Zashev (2001). On the Recursion Theorem in Iterative Operative Spaces. Journal of Symbolic Logic 66 (4):1727-1748.score: 24.0
    The recursion theorem in abstract partially ordered algebras, such as operative spaces and others, is the most fundamental result of algebraic recursion theory. The primary aim of the present paper is to prove this theorem for iterative operative spaces in full generality. As an intermediate result, a new and rather large class of models of the combinatory logic is obtained.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  57. Melvin Fitting (1987). Computability Theory, Semantics, and Logic Programming. Clarendon Press.score: 24.0
    This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great interest. Fitting considers the relation of PROLOG logic programming to the LISP type of language.
     
    My bibliography  
     
    Export citation  
  58. Erich Grädel & Yuri Gurevich (1995). Tailoring Recursion for Complexity. Journal of Symbolic Logic 60 (3):952-969.score: 24.0
    We design functional algebras that characterize various complexity classes of global functions. For this purpose, classical schemata from recursion theory are tailored for capturing complexity. In particular we present a functional analog of first-order logic and describe algebras of the functions computable in nondeterministic logarithmic space, deterministic and nondeterministic polynomial time, and for the functions computable by AC 1 -circuits.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  59. Massimo Pigliucci (2012). On the Different Ways of ‘‘Doing Theory’’ in Biology. Biological Theory:DOI 10.1007/s13752-012-0047-1.score: 21.0
    ‘‘Theoretical biology’’ is a surprisingly heter- ogeneous field, partly because it encompasses ‘‘doing the- ory’’ across disciplines as diverse as molecular biology, systematics, ecology, and evolutionary biology. Moreover, it is done in a stunning variety of different ways, using anything from formal analytical models to computer sim- ulations, from graphic representations to verbal arguments. In this essay I survey a number of aspects of what it means to do theoretical biology, and how they compare with the allegedly much more restricted (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  60. Pablo Gilabert (2012). Comparative Assessments of Justice, Political Feasibility, and Ideal Theory. Ethical Theory and Moral Practice 15 (1):39-56.score: 21.0
    What should our theorizing about social justice aim at? Many political philosophers think that a crucial goal is to identify a perfectly just society. Amartya Sen disagrees. In The Idea of Justice, he argues that the proper goal of an inquiry about justice is to undertake comparative assessments of feasible social scenarios in order to identify reforms that involve justice-enhancement, or injustice-reduction, even if the results fall short of perfect justice. Sen calls this the “comparative approach” to the theory (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  61. Robert S. Taylor (2012). Hate Speech, the Priority of Liberty, and the Temptations of Nonideal Theory. Ethical Theory and Moral Practice 15 (3):353-68.score: 21.0
    Are government restrictions on hate speech consistent with the priority of liberty? This relatively narrow policy question will serve as the starting point for a wider discussion of the use and abuse of nonideal theory in contemporary political philosophy, especially as practiced on the academic left. I begin by showing that hate speech (understood as group libel) can undermine fair equality of opportunity for historically-oppressed groups but that the priority of liberty seems to forbid its restriction. This tension between (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  62. Philippe Mongin (forthcoming). The Doctrinal Paradox, the Discursive Dilemma, and Logical Aggregation Theory. Theory and Decision.score: 21.0
    Judgment aggregation theory, or rather, as we conceive of it here, logical aggregation theory generalizes social choice theory by having the aggregation rule bear on judgments of all kinds instead of merely preference judgments. It derives from Kornhauser and Sager’s doctrinal paradox and List and Pettit’s discursive dilemma, two problems that we distinguish emphatically here. The current theory has developed from the discursive dilemma, rather than the doctrinal paradox, and the final objective of the paper is (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  63. P. T. Johnstone (1987). Notes on Logic and Set Theory. Cambridge University Press.score: 21.0
    A succinct introduction to mathematical logic and set theory, which together form the foundations for the rigorous development of mathematics. Suitable for all introductory mathematics undergraduates, Notes on Logic and Set Theory covers the basic concepts of logic: first-order logic, consistency, and the completeness theorem, before introducing the reader to the fundamentals of axiomatic set theory. Successive chapters examine the recursive functions, the axiom of choice, ordinal and cardinal arithmetic, and the incompleteness theorems. Dr. Johnstone has included (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  64. James Pattison (2013). When Is It Right to Fight? Just War Theory and the Individual-Centric Approach. Ethical Theory and Moral Practice 16 (1):35-54.score: 21.0
    Recent work in the ethics of war has done much to challenge the collectivism of the convention-based, Walzerian just war theory. In doing so, it raises the question of when it is permissible for soldiers to resort to force. This article considers this issue and, in doing so, argues that the rejection of collectivism in just war should go further still. More specifically, it defends the ‘Individual-Centric Approach’ to the deep morality of war, which asserts that the justifiability of (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  65. Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.score: 21.0
    We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  66. Joshua D. Goldstein (2011). New Natural Law Theory and the Grounds of Marriage. Social Theory and Practice 37 (3):461-482.score: 21.0
    New natural lawyers--notably Grisez, Finnis, and George--have written much on civil marriage's moral boundaries and grounds, but with slight influence. The peripheral place of the new natural law theory (NNLT) results from the marital grounds they suggest and the exclusionary moral conclusions they draw from them. However, I argue a more authentic and attractive NNLT account of marriage is recoverable through overlooked resources within the theory itself: friendship and moral self-constitution. This reconstructed account allows us to identify the (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  67. Wouter Floris Kalf (forthcoming). Moral Error Theory, Entailment and Presupposition. Ethical Theory and Moral Practice:1-15.score: 21.0
    According to moral error theory, moral discourse is error-ridden. Establishing error theory requires establishing two claims. These are that moral discourse carries a non-negotiable commitment to there being a moral reality and that there is no such reality. This paper concerns the first and so-called non-negotiable commitment claim. It starts by identifying the two existing argumentative strategies for settling that claim. The standard strategy is to argue for a relation of conceptual entailment between the moral statements that comprise (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  68. Jun Zhang, Trey Hedden & Adrian Chia (2012). Perspective-Taking and Depth of Theory-of-Mind Reasoning in Sequential-Move Games. Cognitive Science 36 (3):560-573.score: 21.0
    Theory-of-mind (ToM) involves modeling an individual’s mental states to plan one’s action and to anticipate others’ actions through recursive reasoning that may be myopic (with limited recursion) or predictive (with full recursion). ToM recursion was examined using a series of two-player, sequential-move matrix games with a maximum of three steps. Participants were assigned the role of Player I, controlling the initial and the last step, or of Player II, controlling the second step. Appropriate for the assigned (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  69. Barry Smith (1988). Gestalt Theory: An Essay in Philosophy. In Barry Smith (ed.), Foundations of Gestalt Theory. Philosophia.score: 21.0
    The Austrian philosopher Christian von Ehrenfels published his essay "On 'Gestalt Qualities'" in 1890. The essay initiated a current of thought which enjoyed a powerful position in the philosophy and psychology of the first half of this century and has more recently enjoyed a minor resurgence of interest in the area of cognitive science, above all in criticisms of the so-called 'strong programme' in artificial intelligence. The theory of Gestalt is of course associated most specifically with psychologists of the (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  70. Graham Parsons (2012). The Incoherence of Walzer's Just War Theory. Social Theory and Practice 38 (4):663-88.score: 21.0
    In his Just and Unjust Wars, Michael Walzer claims that his theory of just war is based on the rights of individuals to life and liberty. This is not the case. Walzer in fact bases his theory of jus ad bellum on the supreme rights of supra-individual political communities. According to his theory of jus ad bellum, the rights of political communities are of utmost importance, and individuals can be sacrificed for the sake of these communal rights. (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  71. Noel Carroll (1996). Prospects for Film Theory: A Personal Assessment. In David Bordwell Noel Carroll (ed.), Post-Theory: Reconstructing Film Studies. University of Wisconsin Press.score: 21.0
    Theory appears to have played the ideological-institutional role of enfranchiser, even if the role was ulti-mately an epiphenomenal one. Furthermore, the expectation of gold in "them thar hills" also encouraged too many university presses to invest in film publications, especially when the arcane peregrinations of Theory facilitated their rationalization of their relaxation of their traditional role as academic gatekeepers. Hence film studies has been flooded with repetitive decoctions of the Theory in search of the same market in (...)
     
    My bibliography  
     
    Export citation  
  72. Amparo Diez (1994). Nota Sobre Pluralidad Y Recursión: Ontosemántica Fregeana Para Un Analisis de Las Teorías. Theoria 9 (2):193-202.score: 21.0
    In this note I discuss some topics recently analysed by C.U. Moulines in Pluralidad y recursión showing the interest of Frege’s ontosemantic theory for the study of scientific theories. I point out some misunderstandings in making use of fregean view by clarifying the basic notions of objectivity, sense, reference, concept, and object. It is not my aim here to solve the difficulties arising the possibility of identifying two theories as one. Nevertheless, I ofter some clues to achieve such an (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  73. Omar Lizardo (2013). Re‐Conceptualizing Abstract Conceptualization in Social Theory: The Case of the “Structure” Concept. Journal for the Theory of Social Behaviour 43 (2):155-180.score: 21.0
    I this paper, I draw on recent research on the radically embodied and perceptual bases of conceptualization in linguistics and cognitive science to develop a new way of reading and evaluating abstract concepts in social theory. I call this approach Sociological Idea Analysis. I argue that, in contrast to the traditional view of abstract concepts, which conceives them as amodal “presuppositions” removed from experience, abstract concepts are irreducibly grounded in experience and partake of non-negotiable perceptual-symbolic features from which a (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  74. István Németi & Gábor Sági (2000). On the Equational Theory of Representable Polyadic Equality Algebras. Journal of Symbolic Logic 65 (3):1143-1167.score: 21.0
    Among others we will prove that the equational theory of ω dimensional representable polyadic equality algebras (RPEA ω 's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable (and hence the equational theory of this class is finite schema-axiomatizable, as well). We will also show that the complexity of the equational theory of RPEA ω is also extremely high in (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  75. Peter Carruthers (2004). Hop Over FOR, HOT Theory. In Rocco J. Gennaro (ed.), Higher-Order Theories of Consciousness: An Anthology. John Benjamins.score: 19.0
    Following a short introduction, this chapter begins by contrasting two different forms of higher-order perception (HOP) theory of phenomenal consciousness - inner sense theory versus a dispositionalist kind of higher-order thought (HOT) theory - and by giving a brief statement of the superiority of the latter. Thereafter the chapter considers arguments in support of HOP theories in general. It develops two parallel objections against both first-order representationalist (FOR) theories and actualist forms of HOT theory. First, neither (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  76. James Giles (1993). The No-Self Theory: Hume, Buddhism, and Personal Identity. Philosophy East and West 43 (2):175-200.score: 18.0
    The problem of personal identity is often said to be one of accounting for what it is that gives persons their identity over time. However, once the problem has been construed in these terms, it is plain that too much has already been assumed. For what has been assumed is just that persons do have an identity. A new interpretation of Hume's no-self theory is put forward by arguing for an eliminative rather than a reductive view of personal identity, (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  77. Arif Ahmed, Causal Decision Theory is False.score: 18.0
    Causal Decision Theory (CDT) cares only about the effects of a contemplated act, not its causes. The paper constructs a case in which CDT consequently recommends a bet that the agent is certain to lose, rather than a bet that she is certain to win. CDT is plainly giving wrong advice in this case. It therefore stands refuted.
    Direct download  
     
    My bibliography  
     
    Export citation  
  78. Todd Buras (2006). Counterpart Theory, Natural Properties, and Essentialism. Journal of Philosophy 103 (1):27-42.score: 18.0
    David Lewis advised essentialists to judge his counterpart theory a false friend. He also argued that counterpart theory needs natural properties. This essay argues that natural properties are all essentialists need to find a true friend in counterpart theory. Section one explains why Lewis takes counterpart theory to be anti-essentialist and why he thinks it needs natural properties. Section two establishes the connection between the natural properties counterpart theory needs and the essentialist consequences Lewis disavows. (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  79. David Robb (2013). The Identity Theory as a Solution to the Exclusion Problem. In S. C. Gibb, E. J. Lowe & R. D. Ingthorsson (eds.), Mental Causation and Ontology. Oxford University Press.score: 18.0
    This is about a proposed solution to the exclusion problem, one I've defended elsewhere (for example, in "The Properties of Mental Causation"). Details aside, it's just the identity theory: mental properties face no threat of exclusion from, or preemption by, physical properties, because every mental property is a physical property. Here I elaborate on this solution and defend it from some objections. One of my goals is to place it in the context of a more general ontology of properties, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  80. William F. Brewer & Bruce L. Lambert (2001). The Theory-Ladenness of Observation and the Theory-Ladenness of the Rest of the Scientific Process. Philosophy of Science 3 (September):S176-S186.score: 18.0
    We use evidence from cognitive psychology and the history of science to examine the issue of the theory-ladenness of perceptual observation. This evidence shows that perception is theory-laden, but that it is only strongly theory-laden when the perceptual evidence is ambiguous or degraded, or when it requires a difficult perceptual judgment. We argue that debates about the theory-ladenness issue have focused too narrowly on the issue of perceptual experience, and that a full account of the scientific (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  81. Axel Honneth (2007). Disrespect: The Normative Foundations of Critical Theory. Polity Press.score: 18.0
    Over the last decade, Axel Honneth has established himself as one of the leading social and political philosophers in the world today. Rooted in the tradition of critical theory, his writings have been central to the revitalization of critical theory and have become increasingly influential. His theory of recognition has gained worldwide attention and is seen by some as the principal counterpart to Habermass theory of discourse ethics. In this important new volume, Honneth pursues his path-breaking (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  82. Jussi Jylkkä (2008). Concepts and Reference: Defending a Dual Theory of Natural Kind Concepts. Dissertation, University of Turkuscore: 18.0
    In this thesis I argue that the psychological study of concepts and categorisation, and the philosophical study of reference are deeply intertwined. I propose that semantic intuitions are a variety of categorisation judgements, determined by concepts, and that because of this, concepts determine reference. I defend a dual theory of natural kind concepts, according to which natural kind concepts have distinct semantic cores and non-semantic identification procedures. Drawing on psychological essentialism, I suggest that the cores consist of externalistic placeholder (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  83. Gerd Muller & Massimo Pigliucci (2011). Extended Synthesis: Theory Expansion or Alternative? Biological Theory 5 (3):275-276.score: 18.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  84. Shan Gao, Why the de Broglie-Bohm Theory is Probably Wrong.score: 18.0
    We investigate the validity of the field explanation of the wave function by analyzing the mass and charge density distributions of a quantum system. It is argued that a charged quantum system has effective mass and charge density distributing in space, proportional to the square of the absolute value of its wave function. This is also a consequence of protective measurement. If the wave function is a physical field, then the mass and charge density will be distributed in space simultaneously (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  85. Katalin Balog (2000). Phenomenal Judgment and the HOT Theory: Comments on David Rosenthal’s “Consciousness, Content, and Metacognitive Judgments”. Consciousness and Cognition 9 (2):215-219.score: 18.0
    In this commentary I criticize David Rosenthal’s higher order thought theory of consciousness (HOT). This is one of the best articulated philosophical accounts of consciousness available. The theory is, roughly, that a mental state is conscious in virtue of there being another mental state, namely, a thought to the effect that one is in the first state. I argue that this account is open to the objection that it makes “HOT-zombies” possible, i.e., creatures that token higher order mental (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  86. John Martin Fischer & Mark Ravizza (1998). Responsibility and Control: A Theory of Moral Responsibility. Cambridge University Press.score: 18.0
    This book provides a comprehensive, systematic theory of moral responsibility. The authors explore the conditions under which individuals are morally responsible for actions, omissions, consequences, and emotions. The leading idea in the book is that moral responsibility is based on 'guidance control'. This control has two components: the mechanism that issues in the relevant behavior must be the agent's own mechanism, and it must be appropriately responsive to reasons. The book develops an account of both components. The authors go (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  87. Ben Bramble (2013). The Distinctive Feeling Theory of Pleasure. Philosophical Studies 162 (2):201-217.score: 18.0
    In this article, I attempt to resuscitate the perennially unfashionable distinctive feeling theory of pleasure (and pain), according to which for an experience to be pleasant (or unpleasant) is just for it to involve or contain a distinctive kind of feeling. I do this in two ways. First, by offering powerful new arguments against its two chief rivals: attitude theories, on the one hand, and the phenomenological theories of Roger Crisp, Shelly Kagan, and Aaron Smuts, on the other. Second, (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  88. Markus E. Schlosser (2010). Agency, Ownership, and the Standard Theory. In A. Buckareff, J. Aguilar & K. Frankish (eds.), New Waves in the Philosophy of Action. Palgrave Macmillan.score: 18.0
    The causal theory of action has been the standard view in the philosophy of action and mind. In this chapter, I will present responses to two challenges to the theory. The first says, basically, that there is no positive argument in favour of the causal theory, as the only reason that supports it consists in the apparent lack of tenable alternatives. The second challenge says that the theory fails to capture the phenomenon of agency, as it (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  89. Bartlomiej Swiatczak (2011). Conscious Representations: An Intractable Problem for the Computational Theory of Mind. Minds and Machines 21 (1):19-32.score: 18.0
    Advocates of the computational theory of mind claim that the mind is a computer whose operations can be implemented by various computational systems. According to these philosophers, the mind is multiply realisable because—as they claim—thinking involves the manipulation of syntactically structured mental representations. Since syntactically structured representations can be made of different kinds of material while performing the same calculation, mental processes can also be implemented by different kinds of material. From this perspective, consciousness plays a minor role in (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  90. P. B. Andrews (2002). An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Kluwer Academic Publishers.score: 18.0
    This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability. The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  91. Boudewijn de Bruin (2005). Game Theory in Philosophy. Topoi 24 (2):197-208.score: 18.0
    Game theory is the mathematical study of strategy and conflict. It has wide applications in economics, political science, sociology, and, to some extent, in philosophy. Where rational choice theory or decision theory is concerned with individual agents facing games against nature, game theory deals with games in which all players have preference orderings over the possible outcomes of the game. This paper gives an informal introduction to the theory and a survey of applications in diverse (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  92. Richard Harland (1999). Literary Theory From Plato to Barthes: An Introductory History. St. Martin's Press.score: 18.0
    Richard Harland provides a lucid account of all the major movements in literary theory up to the late 1960s. In a lucid and accessible style, he unfolds a comprehensive "story" of literary theory in all its manifestations. Because contemporary literary theory depends heavily upon European thinkers, the book has an international focus, and its coverage extends from philosophers to social theorists to linguists. Harland explains the essential principles of each theoretical position, looking behind particular critical judgments and (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  93. Richard Healey, How Quantum Theory Helps Us Explain.score: 18.0
    I offer an account of how the quantum theory we have helps us explain so much. The account depends on a pragmatist interpretation of the theory: This takes a quantum state to serve solely as a source of sound advice to physically situated agents on the content and appropriate degree of belief about matters concerning which they are currently inevitably ignorant. The general account of how to use quantum states and probabilities to explain otherwise puzzling regularities is then (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  94. Jonathan Dancy (1995). Why There Is Really No Such Thing as the Theory of Motivation. Proceedings of the Aristotelian Society 95:1-18.score: 18.0
    To the extent, then, that we set our face against admitting the truth of Humeanism in the theory of motivation, to that extent we are probably going to feel that there is no such thing as the theory of motivation, so conceived, at all. And that will be the position that this paper is trying to defend, though not only for this reason. It might seem miraculous that so much can be extracted from the little distinction with which (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  95. Nicholas Everitt (2007). Some Problems with Virtue Theory. Philosophy 82 (2):275-299.score: 18.0
    Abstract: I examine virtue theory, especially as expressed by Rosalind Hursthouse. In its canonical form, the theory claims that living a life of virtue constitutes flourishing, although it also has a possible fall-back claim that a life of virtue is a means to the end of flourishing. I argue that in both interpretations, virtue theory is mistaken. It cannot give any convincing account of how the concepts of wanting, flourishing, and the virtues are connected, nor can it (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  96. Chris Beasley (1999). What is Feminism?: An Introduction to Feminist Theory. Sage.score: 18.0
    So what is feminism anyway? Why are all the experts so reluctant to give us a clear definition? Is it possible to make sense of the complex and often contradictory debates? In this concise and accessible introduction to feminist theory, Chris Beasley provides clear explanations of the many types of feminism. She outlines the development of liberal, radical and Marxist//socialist feminism, and reviews the more contemporary influences of psychoanalysis, postmodernism, theories of the body, queer theory, and attends to (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  97. Marcus P. Adams (2013). Explaining the Theory of Mind Deficit in Autism Spectrum Disorder. Philosophical Studies 163 (1):233-249.score: 18.0
    The theory of mind (ToM) deficit associated with autism has been a central topic in the debate about the modularity of the mind. Most involved in the debate about the explanation of the ToM deficit have failed to notice that autism’s status as a spectrum disorder has implications about which explanation is more plausible. In this paper, I argue that the shift from viewing autism as a unified syndrome to a spectrum disorder increases the plausibility of the explanation of (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  98. Michael A. Bishop (2002). The Theory Theory Thrice Over: The Child as Scientist, Superscientist, or Social Institution? Studies in History and Philosophy of Science 33 (1):121-36.score: 18.0
    Alison Gopnik and Andrew Meltzoff have argued for a view they call the ‘theory theory’: theory change in science and children are similar. While their version of the theory theory has been criticized for depending on a number of disputed claims, we argue that there is a fundamental problem which is much more basic: the theory theory is multiply ambiguous. We show that it might be claiming that a similarity holds between theory (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  99. Euan J. Squires (1993). Quantum Theory and the Relation Between the Conscious Mind and the Physical World. Synthese 97 (1):109-23.score: 18.0
    The measurement problem of quantum theory is discussed, and the difficulty of trying to solve it within the confines of a local, Lorentz-invariant physics is emphasised. This leads to the obvious suggestion to seek a solution beyond physics, in particular, by introducing the concept of consciousness. The resulting dualistic model, in the natural form suggested by quantum theory, is shown to differ in several respects from the classical model of Descartes, and to suggest solutions to some of the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  100. Marcus P. Adams (2011). Modularity, Theory of Mind, and Autism Spectrum Disorder. Philosophy of Science 78 (5):763-773.score: 18.0
    The theory of mind (ToM) deficit associated with autism spectrum disorder has been a central topic in the debate about the modularity of the mind. In a series of papers, Philip Gerrans and Valerie Stone argue that positing a ToM module does not best explain the deficits exhibited by individuals with autism (Gerrans 2002; Stone & Gerrans 2006a, 2006b; Gerrans & Stone 2008). In this paper, I first criticize Gerrans and Stone’s (2008) account. Second, I discuss various studies of (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
1 — 100 / 1000