140 found
Order:
Disambiguations
G. Kreisel [104]Georg Kreisel [38]
  1.  16
    Informal Rigour and Completeness Proofs.Georg Kreisel - 1967 - In Imre Lakatos (ed.), Problems in the philosophy of mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 138--157.
    Direct download  
     
    Export citation  
     
    Bookmark   172 citations  
  2.  81
    Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems.G. Kreisel & A. Lévy - 1968 - Mathematical Logic Quarterly 14 (7-12):97-142.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   69 citations  
  3.  11
    Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   60 citations  
  4. Interpretation of analysis by means of constructive functionals of finite types.Georg Kreisel - 1959 - In A. Heyting (ed.), Constructivity in mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 101--128.
     
    Export citation  
     
    Bookmark   55 citations  
  5.  29
    Formal systems for some branches of intuitionistic analysis.G. Kreisel - 1970 - Annals of Mathematical Logic 1 (3):229.
  6.  16
    A survey of proof theory.G. Kreisel - 1968 - Journal of Symbolic Logic 33 (3):321-388.
  7.  15
    Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkul.G. Kreisel - 1957 - Archive for Mathematical Logic 3 (3-4):74.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   42 citations  
  8.  33
    Foundations of Intuitionistic Logic.G. Kreisel - 1965 - Journal of Symbolic Logic 30 (2):243-244.
  9.  20
    On weak completeness of intuitionistic predicate logic.G. Kreisel - 1962 - Journal of Symbolic Logic 27 (2):139-158.
  10.  73
    On the interpretation of non-finitist proofs–Part II.G. Kreisel - 1952 - Journal of Symbolic Logic 17 (1):43-58.
  11.  66
    On the interpretation of non-finitist proofs—Part I.G. Kreisel - 1951 - Journal of Symbolic Logic 16 (4):241-267.
  12.  5
    Hilbert's programme.Georg Kreisel - 1958 - Dialectica 12 (3‐4):346-372.
    Hilbert's plan for understanding the concept of infinity required the elimination of non‐finitist machinery from proofs of finitist assertions. The failure of the original plan leads to a hierarchy of progressively less elementary, but still constructive methods instead of finitist ones . A mathematical proof of this failure requires a definition of « finitist ».—The paper sketches the three principal methods for the syntactic analysis of non‐constructive mathematics, the resulting consistency proofs and constructive interpretations, modelled on Herbrand's theorem, and their (...)
    Direct download  
     
    Export citation  
     
    Bookmark   26 citations  
  13. Mathematical Logic.Georg Kreisel - 1965 - In Lectures on Modern Mathematics. New York: Wiley. pp. 95-195.
    No categories
     
    Export citation  
     
    Bookmark   25 citations  
  14.  10
    Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis.W. A. Howard & G. Kreisel - 1966 - Journal of Symbolic Logic 31 (3):325-358.
  15.  2
    A notion of mechanistic theory.G. Kreisel - 1974 - Synthese 29 (1-4):11 - 26.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  16.  6
    Metarecursive sets.G. Kreisel & Gerald E. Sacks - 1965 - Journal of Symbolic Logic 30 (3):318-338.
    Our ultimate purpose is to give an axiomatic treatment of recursion theory sufficient to develop the priority method. The direct or abstract approach is to keep in mind as clearly as possible the methods actually used in recursion theory, and then to formulate them explicitly. The indirect or experimental approach is to look first for other mathematical theories which seem similar to recursion theory, to formulate the analogies precisely, and then to search for an axiomatic treatment which covers not only (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  17.  7
    Mathematical significance of consistency proofs.G. Kreisel - 1958 - Journal of Symbolic Logic 23 (2):155-182.
  18.  4
    Elements of mathematical logic.Georg Kreisel - 1967 - Amsterdam,: North Holland Pub. Co.. Edited by J. L. Krivine.
  19.  12
    Hilbert's Programme.Georg Kreisel - 1962 - Journal of Symbolic Logic 27 (2):228-229.
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  20.  13
    Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  21.  3
    A remark on free choice sequences and the topological completeness proofs.G. Kreisel - 1958 - Journal of Symbolic Logic 23 (4):369-388.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  22.  8
    Problems.Heinrich Scholz, G. Kreisel & Leon Henkin - 1952 - Journal of Symbolic Logic 17 (2):160.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  23.  18
    Some Reasons for Generalizing Recursion Theory.G. Kreisel, R. O. Gandy & C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
    Direct download  
     
    Export citation  
     
    Bookmark   14 citations  
  24.  14
    Church's thesis and the ideal of informal rigour.Georg Kreisel - 1987 - Notre Dame Journal of Formal Logic 28 (4):499-519.
  25.  11
    Mathematical Significance of Consistency Proofs.G. Kreisel - 1966 - Journal of Symbolic Logic 31 (1):129-129.
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  26.  7
    Two notes on the foundations of set‐theory.G. Kreisel - 1969 - Dialectica 23 (2):93-114.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  27.  7
    Which number theoretic problems can be solved in recursive progressions on Π1 1-paths through O?G. Kreisel - 1972 - Journal of Symbolic Logic 37 (2):311-334.
  28.  25
    Recent Results in Set Theory.Andrzej Mostowski, Imre Lakatos, G. Kreisel, A. Robinson & A. Mostowski - 1972 - Journal of Symbolic Logic 37 (4):765-766.
  29.  6
    1 — Consistency and faithful interpretations.S. Feferman, G. Kreisel & S. Orey - 1962 - Archive for Mathematical Logic 6 (1-2):52-63.
  30.  21
    A variant to Hilbert's theory of the foundations of arithmetic.G. Kreisel - 1953 - British Journal for the Philosophy of Science 4 (14):107-129.
    IN Hilbert's theory of the foundations of any given branch of mathematics the main problem is to establish the consistency (of a suitable formalisation) of this branch. Since the (intuitionist) criticisms of classical logic, which Hilbert's theory was intended to meet, never even alluded to inconsistencies (in classical arithmetic), and since the investigations of Hilbert's school have always established much more than mere consistency, it is natural to formulate another general problem in the foundations of mathematics: to translate statements of (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  31.  8
    Mathematical interpretation of formal systems.Thoralf Skolem, G. Hasenjaeger, G. Kreisel, A. Robinson, Hao Wang, L. Henkin & J. Łoś (eds.) - 1971 - Amsterdam: North-Holland Pub. Co..
  32. Principles of proof, etc.G. Kreisel - 1970 - In A. Kino, John Myhill & Richard Eugene Vesley (eds.), Intuitionism and proof theory. Amsterdam,: North-Holland Pub. Co.. pp. 489--5.
     
    Export citation  
     
    Bookmark   9 citations  
  33.  15
    A Computable Ordinary Differential Equation with Possesses no Computable Solution.G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  34.  37
    Number Theoretic Concepts and Recursive Well-Orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1966 - Journal of Symbolic Logic 31 (3):511-512.
  35.  8
    Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae.G. Kreisel - 1958 - Journal of Symbolic Logic 23 (3):317-330.
  36.  47
    Set Existence.R. O. Gandy, G. Kreisel & W. W. Tait - 1962 - Journal of Symbolic Logic 27 (2):232-233.
  37.  53
    On a Problem of Henkin's.G. Kreisel - 1954 - Journal of Symbolic Logic 19 (3):219-220.
  38.  30
    Mathematical Problems. Lecture Delivered Before the International Congress of Mathematicians at Paris in 1900.David Hilbert, Mary Winston Newsom, Felix E. Browder, Donald A. Martin, G. Kreisel & Martin Davis - 1979 - Journal of Symbolic Logic 44 (1):116-119.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  39.  5
    On Weak Completeness of Intuitionistic Predicate Logic.G. Kreisel - 1969 - Journal of Symbolic Logic 34 (1):119-120.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  40.  7
    Mathematical logic: Tool and object lesson for science.Georg Kreisel - 1985 - Synthese 62 (2):139-151.
    The object lesson concerns the passage from the foundational aims for which various branches of modern logic were originally developed to the discovery of areas and problems for which logical methods are effective tools. The main point stressed here is that this passage did not consist of successive refinements, a gradual evolution by adaptation as it were, but required radical changes of direction, to be compared to evolution by migration. These conflicts are illustrated by reference to set theory, model theory, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  41.  11
    Persistent and Invariant Formulas Relative to Theories of Higher Order.S. Feferman, G. Kreisel & Solomon Feferman - 1972 - Journal of Symbolic Logic 37 (4):764-765.
  42.  9
    Ensembles Récursivement Mesurable et Ensembles Récursivement Ouverts ou Fermés.Georg Kreisel & Daniel Lacombe - 1966 - Journal of Symbolic Logic 31 (1):133-133.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  43.  5
    Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus.G. Kreisel - 1953 - Journal of Symbolic Logic 18 (2):180-181.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  44.  6
    On the Interpretation of Non-Finitist Proofs.G. Kreisel - 1953 - Journal of Symbolic Logic 18 (1):78-80.
  45.  19
    Some Applications of Formalized Consistency Proofs.G. Kreisel & Hao Wang - 1956 - Journal of Symbolic Logic 21 (4):404-405.
  46.  10
    The Axiom of Choice and the Class of Hyperarithmetic Functions.G. Kreisel - 1970 - Journal of Symbolic Logic 35 (2):333-334.
  47.  8
    Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi.Georg Kreisel & William W. Tait - 1961 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (1-5):28-38.
  48. Reply to Professor Bar-Hillel.G. Kreisel - 1967 - In Imre Lakatos (ed.), Problems in the philosophy of mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 175--178.
    No categories
     
    Export citation  
     
    Bookmark   4 citations  
  49.  2
    Second thoughts around some of göde's writings:.G. Kreisel - 1998 - Synthese 114 (1):99-160.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  50.  13
    Sums of Squares.Leon Henkin & G. Kreisel - 1966 - Journal of Symbolic Logic 31 (1):128-129.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 140