<--- Back to Details
First PageDocument Content
Logic / Mathematical logic / Abstraction / Model theory / Proof theory / Predicate logic / Logic in computer science / Philosophical logic / Skolem normal form / Herbrandization / First-order logic / Intuitionistic logic
Date: 2008-02-06 05:45:02
Logic
Mathematical logic
Abstraction
Model theory
Proof theory
Predicate logic
Logic in computer science
Philosophical logic
Skolem normal form
Herbrandization
First-order logic
Intuitionistic logic

On Skolemization in constructive theories Matthias Baaz∗ Rosalie Iemhoff Inst. for Discrete Math. and Geometry E104

Add to Reading List

Source URL: www.phil.uu.nl

Download Document from Source Website

File Size: 294,53 KB

Share Document on Facebook

Similar Documents

Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany  Abstract. In this paper, we present a predic

Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany Abstract. In this paper, we present a predic

DocID: 1xUQe - View Document

J. Korean Math. Soc.  FORMALIZING THE META-THEORY OF FIRST-ORDER PREDICATE LOGIC Hugo Herberlin, SunYoung Kim, and Gyesik Lee Abstract. This paper introduces a representation style of variable binding using dependent typ

J. Korean Math. Soc. FORMALIZING THE META-THEORY OF FIRST-ORDER PREDICATE LOGIC Hugo Herberlin, SunYoung Kim, and Gyesik Lee Abstract. This paper introduces a representation style of variable binding using dependent typ

DocID: 1v7hr - View Document

STRICT PREDICATIVITY1 Charles Parsons The most basic notion of impredicativity applies to specifications or definitions of sets or classes. If a set b is specified as {x: A(x)} for some predicate A, then the specificatio

STRICT PREDICATIVITY1 Charles Parsons The most basic notion of impredicativity applies to specifications or definitions of sets or classes. If a set b is specified as {x: A(x)} for some predicate A, then the specificatio

DocID: 1unjy - View Document

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

DocID: 1tDnH - View Document

Predicate Abstraction in a Program Logic Calculus Benjamin Weiß Institute for Theoretical Computer Science University of Karlsruhe, DKarlsruhe, Germany

Predicate Abstraction in a Program Logic Calculus Benjamin Weiß Institute for Theoretical Computer Science University of Karlsruhe, DKarlsruhe, Germany

DocID: 1sZ2t - View Document