Order:
Disambiguations
Ch Cornaros [6]Charalampos Cornaros [1]
  1.  5
    On Grzegorczyk Induction.Ch Cornaros - 1995 - Annals of Pure and Applied Logic 74 (1):1-21.
    We investigate the “mathematical” strength of the theory I*2. In particular we prove the quadratic reciprocity law and Bertrand's postulate, using fragments of I*2 which employ some well-known number-theoretic functions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  14
    On Two Problems Concerning End Extensions.Ch Cornaros & C. Dimitracopoulos - 2008 - Archive for Mathematical Logic 47 (1):1-14.
    We study problems of Clote and Paris, concerning the existence of end extensions of models of Σ n -collection. We continue the study of the notion of ‘Γ-fullness’, begun by Wilkie and Paris (Logic, Methodology and Philosophy of Science VIII (Moscow, 1987). Stud. Logic Found. Math., vol. 126, pp. 143–161. North- Holland, Amsterdam, 1989) and introduce and study a generalization of it, to be used in connection with the existence of Σ n -elementary end extensions (instead of plain end extensions). (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  29
    A Note on End Extensions.Ch Cornaros & C. Dimitracopoulos - 2000 - Archive for Mathematical Logic 39 (6):459-463.
    . We provide an alternative proof of a theorem of P. Clote concerning end extensions of models of $\Sigma_n$ -induction, for $n \geq 2$.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  16
    A Note on Exponentiation.Ch Cornaros & C. Dimitracopoulos - 1993 - Journal of Symbolic Logic 58 (1):64-71.
    We study the strength (over bounded induction) of axioms expressing particular cases of the Chinese Remainder Theorem with respect to the axiom ∀ x, y∃ z (z = xy).
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  5.  10
    On Bounded Arithmetic Augmented by the Ability to Count Certain Sets of Primes.Alan R. Woods & Ch Cornaros - 2009 - Journal of Symbolic Logic 74 (2):455-473.
    Over 25 years ago, the first author conjectured in [15] that the existence of arbitrarily large primes is provable from the axioms I Δ₀(π) + def(π), where π(x) is the number of primes not exceeding x, IΔ₀(π) denotes the theory of Δ₀ induction for the language of arithmetic including the new function symbol π, and de f(π) is an axiom expressing the usual recursive definition of π. We prove a modified version in which π is replaced by a more general (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  6. Ignjatovik, A., See Buss, SR.A. W. Apter, M. Magidor, Ch Cornaros & K. Hauser - 1995 - Annals of Pure and Applied Logic 74:297.
     
    Export citation  
     
    Bookmark