Theorem-proving systems

Ewa Orłowska

  • Publisher: Instytut Matematyczny Polskiej Akademi Nauk(Warszawa), 1973

Abstract

top
CONTENTSIntroduction.................................................................................................................... 6Chapter I. Theorem-proving system§ 1. Theory...................................................................................................................... 7§ 2. Fundamental theory T ƒ ................................................................................ 8§ 3. Theorem-proving system.................................................................................... 16Chapter II. Theorem-proving process§ 1. Diagram of a formula........................................................................................... 20§ 2. The set T of partial diagrams.............................................................................. 20§ 3. Properties of the set T of partial diagram......................................................... 22§ 4. Theorem-proving process........................................................................ 27Chapter III. Properties of theorem-proving systems§ 1. Existence and uniqueness of an unextendable process.............................. 32§ 2. Properties of the set of theorem-proving processes..................................... 33§ 3. C- systems............................................................................................................. 36§ 4. Equivalence of theorem-proving systems........................................................ 38§ 5. Theorem-proving algorithms.............................................................................. 43References.................................................................................................................... 48

How to cite

top

Ewa Orłowska. Theorem-proving systems. Warszawa: Instytut Matematyczny Polskiej Akademi Nauk, 1973. <http://eudml.org/doc/268529>.

@book{EwaOrłowska1973,
abstract = {CONTENTSIntroduction.................................................................................................................... 6Chapter I. Theorem-proving system§ 1. Theory...................................................................................................................... 7§ 2. Fundamental theory $T_ƒ$ ................................................................................ 8§ 3. Theorem-proving system.................................................................................... 16Chapter II. Theorem-proving process§ 1. Diagram of a formula........................................................................................... 20§ 2. The set T of partial diagrams.............................................................................. 20§ 3. Properties of the set T of partial diagram......................................................... 22§ 4. Theorem-proving process........................................................................ 27Chapter III. Properties of theorem-proving systems§ 1. Existence and uniqueness of an unextendable process.............................. 32§ 2. Properties of the set of theorem-proving processes..................................... 33§ 3. C- systems............................................................................................................. 36§ 4. Equivalence of theorem-proving systems........................................................ 38§ 5. Theorem-proving algorithms.............................................................................. 43References.................................................................................................................... 48},
author = {Ewa Orłowska},
language = {eng},
location = {Warszawa},
publisher = {Instytut Matematyczny Polskiej Akademi Nauk},
title = {Theorem-proving systems},
url = {http://eudml.org/doc/268529},
year = {1973},
}

TY - BOOK
AU - Ewa Orłowska
TI - Theorem-proving systems
PY - 1973
CY - Warszawa
PB - Instytut Matematyczny Polskiej Akademi Nauk
AB - CONTENTSIntroduction.................................................................................................................... 6Chapter I. Theorem-proving system§ 1. Theory...................................................................................................................... 7§ 2. Fundamental theory $T_ƒ$ ................................................................................ 8§ 3. Theorem-proving system.................................................................................... 16Chapter II. Theorem-proving process§ 1. Diagram of a formula........................................................................................... 20§ 2. The set T of partial diagrams.............................................................................. 20§ 3. Properties of the set T of partial diagram......................................................... 22§ 4. Theorem-proving process........................................................................ 27Chapter III. Properties of theorem-proving systems§ 1. Existence and uniqueness of an unextendable process.............................. 32§ 2. Properties of the set of theorem-proving processes..................................... 33§ 3. C- systems............................................................................................................. 36§ 4. Equivalence of theorem-proving systems........................................................ 38§ 5. Theorem-proving algorithms.............................................................................. 43References.................................................................................................................... 48
LA - eng
UR - http://eudml.org/doc/268529
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.