Search results for 'David A. Kalmar' (try it on Scholar)

31 found
Sort by:
  1. David A. Kalmar & Robert J. Sternberg (1988). Theory Knitting: An Integrative Approach to Theory Development. Philosophical Psychology 1 (2):153 – 170.score: 960.0
    A close scrutiny of the psychological literature reveals that many psychologists favor a 'segregative' approach to theory development. One theory is pitted against another, and the one that accounts for the data most successfully is deemed the theory of choice. However, an examination of the theoretical debates in which the segregative approach has been pursued reveals a variety of weaknesses to the approach, namely, masking an underlying theoretical indistinguishability of theoretical predictions, causing psychologists to focus unknowingly on different aspects of (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Robert J. Sternberg, Elena L. Grigorenko & David A. Kalmar (2001). The Role of Theory in Unified Psychology. Journal of Theoretical and Philosophical Psychology 21 (2):99-117.score: 870.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Laszlo Kalmar (1939). On the Reduction of the Decision Problem. First Paper. Ackermann Prefix, a Single Binary Predicate. Journal of Symbolic Logic 4 (1):1 - 9.score: 360.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. László Kalmár & János Surányi (1950). On the Reduction of the Decision Problem: Third Paper. Pepis Prefix, a Single Binary Predicate. Journal of Symbolic Logic 15 (3):161-173.score: 360.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  5. Laszlo Kalmar & Janos Suranyi (1950). On the Reduction of the Decision Problem: Third Paper. Pepis Prefix, a Single Binary Predicate. Journal of Symbolic Logic 15 (3):161 - 173.score: 360.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. László Kalmár (1939). On the Reduction of the Decision Problem. First Paper. Ackermann Prefix, a Single Binary Predicate. Journal of Symbolic Logic 4 (1):1-9.score: 360.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Joseph T. Giacino & Kathleen Kalmar (1997). The Vegetative and Minimally Conscious States: A Comparison of Clinical Features and Functional Outcome. Journal of Head Trauma Rehabilation 12:36-51.score: 360.0
     
    My bibliography  
     
    Export citation  
  8. Deszo Gurka (2006). A Missing Link: The Infuence of László Kalmár's Empirical View on Lakatos' Philosophy of Mathematics. Perspectives on Science 14 (3):263-281.score: 144.0
    The circumstance that the text of Imre Lakatos' doctoral thesis from the University of Debrecen did not survive makes the evaluation of his career in Hungary and the research of aspects of continuity of his lifework difficult. My paper tries to reconstruct these newer aspects of continuity, introducing the influence of László Kalmár the mathematician and his fellow student, and Sándor Karácsony the philosopher and his mentor on Lakatos' work. The connection between the understanding of the empirical basis of exact (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Richard Malone, Caroline Schnakers & Kathleen Kalmar, Does the Four Score Correctly Diagnose the Vegetative and Minimally Conscious States?score: 120.0
    Wijdicks and colleagues1 recently presented the Full Outline of UnResponsiveness (FOUR) scale as an alternative to the Glasgow Coma Scale (GCS)2 in the evaluation of consciousness in severely brain-damaged patients. They studied 120 patients in an intensive care setting (mainly neuro-intensive care) and claimed that “the FOUR score detects a locked-in syndrome, as well as the presence of a vegetative state.”1 We fully agree that the FOUR is advantageous in identifying locked-in patients given that it specifically tests for eye movements (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  10. W. Ackermann (1948). Review: Laszlo Kalmar, Janos Suranyi, On the Reduction of the Decision Problem. Second Paper. Godel Prefix, a Single Binary Predicate. [REVIEW] Journal of Symbolic Logic 13 (1):48-48.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. John G. Kemeny (1952). Review: Laszlo Kalmar, Eine Einfache Konstruktion Unentscheidbarer Satze in Formalen Systemen; Laszlo Kalmar, Ernst V. Glasersfeld, A Simple Construction of Undecidable Propositions in Formal Systems. [REVIEW] Journal of Symbolic Logic 17 (2):150-151.score: 120.0
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  12. Rozsa Peter (1955). Review: Laszlo Kalmar, Reduction of the Decision Problem to the Satisfiability Question of Logical Formulae on a Finite Set. [REVIEW] Journal of Symbolic Logic 20 (1):72-72.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. John G. Kemeny (1959). Review: Laszlo Kalmar, A Direct Proof of the Unsolvability of the Decision Problem by Means of a General Recursive Algorithm. [REVIEW] Journal of Symbolic Logic 24 (2):173-174.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  14. Dezső Gurka (2006). A Missing Link: The Influence of László Kalmár's Empirical View on Lakatos' Philosophy of Mathematics. Perspectives on Science 14 (3):263-281.score: 120.0
  15. Ann M. Singleterry (1966). Review: Laszlo Kalmar, A New Principle of Construction of Logical Machines. [REVIEW] Journal of Symbolic Logic 31 (3):516-516.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  16. Alonzo Church (1952). Review: Laszlo Kalmar, Contributions to the Reduction Theory of the Decision Problem. First Paper. Prefix $(X1)(X_2)(Ex_3)Cdots(Ex_{N-1}(XN)$, a Single Binary Predicate. [REVIEW] Journal of Symbolic Logic 17 (1):73-73.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. Alonzo Church (1953). Review: Laszlo Kalmar, Contributions to the Reduction Theory of the Decision Problem. Fourth Paper Reduction to the Case of a Finite Set of Individuals. [REVIEW] Journal of Symbolic Logic 18 (3):264-265.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  18. William E. Gould (1969). Review: L. Kalmar, A Practical Infinitistic Computer. [REVIEW] Journal of Symbolic Logic 34 (3):510-510.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  19. T. Jech (1972). Review: Andrzej Mostowski, Imre Lakatos, Recent Results in Set Theory; G. Kreisel, A. Robinson, L. Kalmar, A. Mostowski, Discussion; Andrzej Mostowski, On Some New Metamathematical Results Concerning Set Theory. [REVIEW] Journal of Symbolic Logic 37 (4):765-766.score: 120.0
  20. John G. Kemeny (1960). Review: Laszlo Kalmar, The Solution of a Problem of K. Schroter, Concerning the Definition of General Recursive Functions. [REVIEW] Journal of Symbolic Logic 25 (2):164-165.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  21. Rozsa Peter (1941). Review: Laszlo Kalmar, A Hilbert-fele Bizonyitaselmelet Celkituzesei, Modszerei es Eredmenyei (Zielsetzungen, Methoden und Ergebnisse der Hilbertschen Beweistheorie). [REVIEW] Journal of Symbolic Logic 6 (3):110-111.score: 120.0
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  22. Rosza Peter (1944). Review: Laszlo Kalmar, A Matematikai Exaktsag Fejlodese a Szemlelettol az Axiomatikus Modszerig (Die Entwicklung der Mathematischen Exaktheit von der Anschauung bis zur Axiomatischen Methode). [REVIEW] Journal of Symbolic Logic 9 (1):24-25.score: 120.0
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  23. Ann M. Singleterry (1996). Kalmár László. A New Principle of Construction of Logical Machines. 2e Congrès International de Cybernétique, Namur, 3–10 Septembre 1958, Actes, Association Internationale de Cybernétique, Namur 1960, Pp. 458–463. [REVIEW] Journal of Symbolic Logic 31 (3):516-516.score: 120.0
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  24. Th Skolem (1939). Review: Laszlo Kalmar, On the Reduction of the Decision Problem. First Paper. Ackerman Prefix, a Single Binary Predicate. [REVIEW] Journal of Symbolic Logic 4 (3):127-128.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. Th Skolem (1951). Review: Laszlo Kalmar, Janos Suranyi, On the Decision Problem. Third Paper. Pepis Prefix, a Single Binary Predicate. [REVIEW] Journal of Symbolic Logic 16 (3):215-216.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  26. D. A. Clarke (1970). Review: L. Kalmar, Uber Arithmetische Funktionen von unendlich Vielen Variablen, Welche an Jeder Stelle Bloss von Einer Endlichen Anzahl von Variabeln Abhangig sind. [REVIEW] Journal of Symbolic Logic 35 (1):152-152.score: 36.0
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  27. John P. Burgess & A. P. Hazen (1998). Predicative Logic and Formal Arithmetic. Notre Dame Journal of Formal Logic 39 (1):1-17.score: 30.0
    After a summary of earlier work it is shown that elementary or Kalmar arithmetic can be interpreted within the system of Russell's Principia Mathematica with the axiom of infinity but without the axiom of reducibility.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  28. Zlatan Damnjanovic (1997). Elementary Realizability. Journal of Philosophical Logic 26 (3):311-339.score: 24.0
    A realizability notion that employs only Kalmar elementary functions is defined, and, relative to it, the soundness of EA-(Π₁⁰-IR), a fragment of Heyting Arithmetic (HA) with names and axioms for all elementary functions and induction rule restricted to Π₁⁰ formulae, is proved. As a corollary, it is proved that the provably recursive functions of EA-(Π₁⁰-IR) are precisely the elementary functions. Elementary realizability is proposed as a model of strict arithmetic constructivism, which allows only those constructive procedures for which the (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  29. Zlatan Damnjanovic (1994). Elementary Functions and LOOP Programs. Notre Dame Journal of Formal Logic 35 (4):496-522.score: 24.0
    We study a hierarchy of Kalmàr elementary functions on integers based on a classification of LOOP programs of limited complexity, namely those in which the depth of nestings of LOOP commands does not exceed two. It is proved that -place functions in can be enumerated by a single function in , and that the resulting hierarchy of elementary predicates (i.e., functions with 0,1-values) is proper in that there are predicates that are not in . Along the way the rudimentary predicates (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  30. Manuel L. Campagnolo & Kerry Ojakian (2008). The Elementary Computable Functions Over the Real Numbers: Applying Two New Techniques. [REVIEW] Archive for Mathematical Logic 46 (7-8):593-627.score: 24.0
    The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether defined in different manners, via function algebras (Real Recursive Functions) or via Turing Machines (Computable Analysis). We provide general tools for investigating these issues, using two techniques we call approximation and lifting. We use these methods to obtain two main theorems. First, we provide an alternative proof of the result from Campagnolo et al. (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  31. Neil Tennant (1989). Truth Table Logic, with a Survey of Embeddability Results. Notre Dame Journal of Formal Logic 30 (3):459-484.score: 18.0
    Kalrnaric. We set out a system T, consisting of normal proofs constructed by means of elegantly symmetrical introduction and elimination rules. In the system T there are two requirements, called ( ) and ()), on applications of discharge rules. T is sound and complete for Kalmaric arguments. ( ) requires nonvacuous discharge of assumptions; ()) requires that the assumption discharged be the sole one available of highest degree. We then consider a 'Duhemian' extension T*, obtained simply by dropping the requirement (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation