Eliminating definitions and Skolem functions in first-order logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 139-146

  Avigad, J ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FUNCTION EVALUATION; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; SEQUENTIAL MACHINES; THEOREM PROVING;

FIRST ORDER LOGIC; POLYNOMIAL BOUND; SKOLEM FUNCTIONS;

FORMAL LOGIC;

EID: 0034858476     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. The complexity of the pigeonhole principle
2. Formalizing forcing arguments in subsystems of second-order arithmetic
3. Interpreting classical theories in constructive ones
4. Algebraic proofs of the cut-elimination theorems
5. Weak theories of nonstandard arithmetic and analysis
6. Counting problems in bounded arithmetic
7. The lengths of proofs
8. Logic and the axiom of choice