| Tag |
First Indicator |
Second Indicator |
Subfields |
| LEADER |
00000cam a2200000Ii 4500 |
| 001 |
in00004580933 |
| 006 |
m o d |
| 007 |
cr |n||||||||| |
| 008 |
180706s2014 xx o 000 0 eng d |
| 005 |
20220613175747.2 |
| 020 |
|
|
|a 9781482283006
|q (e-book : PDF)
|
| 020 |
|
|
|z 9789056992675
|q (hardback)
|
| 024 |
7 |
|
|a 10.1201/9781482283006
|2 doi
|
| 035 |
|
|
|a (OCoLC)1027782719
|
| 035 |
|
|
|a 9781482283006
|
| 040 |
|
|
|a FlBoTFG
|c FlBoTFG
|e rda
|
| 050 |
|
4 |
|a QA9
|b .F457 2014
|
| 072 |
|
7 |
|a MAT028000
|2 bisacsh
|
| 100 |
1 |
|
|a Felscher, Walter,
|e author.
|
| 245 |
1 |
0 |
|a Lectures on Mathematical Logic, Volume II /
|c Walter Felscher.
|
| 250 |
|
|
|a First edition.
|
| 264 |
|
1 |
|a Boca Raton, FL :
|b CRC Press,
|c 2014.
|
| 300 |
|
|
|a 1 online resource
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 505 |
0 |
|
|a chapter Introduction -- chapter 1 Positive Rules for Deductive Situations -- chapter 2 The Calculus KsP -- chapter 3 The Calculi KtP and KuP -- chapter 4 Inversion Operators -- chapter 5 Tableaux -- part 2 Cuts -- chapter 1 Cut Elimination with Exchange Operators -- chapter 2 Arithmetization -- chapter 1 Explicit Retracing as a Motivation -- chapter 2 The Reduction Operator R0 -- chapter 3 The Reduction Operator R1 and the Elimination Operator -- chapter 1 Negation in Deductive Situations -- chapter 2 The Calculi KM0 of Minimal Logic and KJ0 of Intuitionistic Logic -- chapter 3 The Intermediary Calculi KM1, KJ1 -- chapter 4 The Calculi LM and LJ -- chapter 5 K-Calculi for the Connective -- chapter 6 Tableaux -- part 5 Sequent Calculi for Classical Logic -- chapter 1 The Multiple Calculus MK -- chapter 2 Cut Elimination with Inversion Rules for MK -- chapter 3 MK as a Calculus for Classical Logic -- chapter 4 The Calculi MP, MM and MJ -- chapter 5 The Peirce Rule -- chapter 6 Tableaux -- chapter 1 d-Algebras and d-Frames -- chapter 2 e-Algebras, e-Frames and RPC-Semilattices -- chapter 3 g-Algebras, g-Frames and RPC-Lattices -- chapter 4 m-Algebras, m-Frames and m-Lattices -- chapter 5 i-Algebras, i-Frames and Heyting Algebras -- chapter 6 c-Algebras, c-Frames and Boolean Algebras -- chapter 7 Translations from Classical into Intuitionistic Logic -- part 7 Calculi of Formulas -- chapter 1 Modus Ponens Calculi for Positive Logic -- chapter 2 Modus Ponens Calculi for Minimal and for Intuitionistic Logic -- chapter 3 Modus Ponens Calculi for Classical Logic -- chapter Historical Notes to Chapters 1 - 7 -- chapter 1 Quantifier Rules for Deductive Situations -- chapter 2 Sequent Calculi with Q-rules -- chapter 3 The Replacement Theorem and Cut Elimination for Calculi with rep -- chapter 4 The Substitution Theorem and Cut Elimination for Calculi with sub -- chapter 5 The Sets SUB -- chapter 6 The Substitution Theorem Resumed -- chapter 7 Cut Elimination Resumed -- chapter 8 Inversion Rules -- chapter 1 The Calculi cxqt and cxqs -- chapter 2 The Variants cxqt0 of cxqt -- chapter 3 The Variants cxqt1 and cxqt2 of cxqt -- chapter 4 The Calculi cxqsi -- chapter 5 The Deduction Theorem and Other Metarules for the Calculi ccqti -- chapter 6 Tautologies of Positive Quantifier Logic -- chapter 7 Tautologies of Minimal Quantifier Logic -- chapter 8 Tautologies of Classical Quantifier Logic -- chapter 1 Translating Between Sequential and Modus Ponens Calculi -- chapter 2 Relations between Classical and Intuitionistic Derivability -- chapter 3 Equality Logic -- chapter 4 Language Extensions with Predicate Symbols -- chapter 5 Language Extensions with Function Symbols 1 -- chapter 6 Language Extensions with Function Symbols 2 -- chapter 7 The Midsequent Theorem -- chapter 8 Herbrand's Theorem for Prenex Formulas -- chapter 9 Tableaux.
|
| 520 |
2 |
|
|a "In this volume, logic starts from the observation that in everyday arguments, as brought forward by say a lawyer, statements are transformed linguistically, connecting them in formal ways irrespective of their contents. Understanding such arguments as deductive situations, or "sequents" in the technical terminology, the transformations between them can be expressed as logical rules. The book concludes with the algorithms producing the results of Gentzen's midsequent theorem and Herbrand's theorem for prenex formulas."--Provided by publisher.
|
| 650 |
0 |
4 |
|a Set Theory
|
| 650 |
|
0 |
|a Set theory.
|
| 655 |
|
7 |
|a Electronic books.
|2 local
|
| 710 |
1 |
|
|a Taylor & Francis.
|
| 730 |
0 |
|
|a MATHnetBASE.
|
| 776 |
0 |
8 |
|i Print version:
|z 9789056992675
|w (DLC) 2002421346
|
| 856 |
4 |
0 |
|u http://proxy.library.tamu.edu/login?url=https://www.taylorfrancis.com/books/9781482283006
|z Connect to the full text of this electronic book
|t 0
|
| 999 |
f |
f |
|s 770951d6-da01-4fda-942a-04d2080b8ff8
|i 770951d6-da01-4fda-942a-04d2080b8ff8
|t 0
|
| 952 |
f |
f |
|a Texas A&M University
|b College Station
|c Electronic Resources
|s www_evans
|d Available Online
|t 0
|e QA9 .F457 2014
|h Library of Congress classification
|
| 998 |
f |
f |
|a QA9 .F457 2014
|t 0
|l Available Online
|