Kooperativer Bibliotheksverbund

UID:

Format: 1 Online-Ressource (xx, 307 p.) , ill , 23 cm

Edition: Online-Ausgabe Elsevier e-book collection on ScienceDirect Sonstige Standardnummer des Gesamttitels: 041169-3

ISBN: 0444861718 , 9780444861719

Series Statement: Studies in logic and the foundations of mathematics v. 105

Note: Includes index

Additional Edition: Reproduktion von Fundamentals of generalized recursion theory c1981

Language: English

Subjects: Mathematics

Keywords: Rekursionstheorie

URL: Volltext

URL: Volltext  (Deutschlandweit zugänglich)

Author information: Fitting, Melvin 1942-

UID:

Format: XVI, 326 S.

Edition: 2. ed.

ISBN: 0-387-94593-8

Series Statement: Graduate texts in computer science

Note: WST: First-order logic and automated theorem proving. - Literaturverz. S. 315 - 318

Language: German

Subjects: Computer Science , Mathematics

Keywords: Prädikatenlogik ; Stufe 1 ; Automatisches Beweisverfahren ; Automatisches Beweisverfahren ; Mathematische Logik ; Einführung ; Lehrbuch

URL: Inhaltsverzeichnis

URL: Inhaltstext

UID:

Format: 1 online resource (xxi, 247 pages) : , digital, PDF file(s).

ISBN: 1-108-34803-3 , 1-108-66110-6

Series Statement: Cambridge tracts in mathematics ; 216

Content: Classical logic is concerned, loosely, with the behaviour of truths. Epistemic logic similarly is about the behaviour of known or believed truths. Justification logic is a theory of reasoning that enables the tracking of evidence for statements and therefore provides a logical framework for the reliability of assertions. This book, the first in the area, is a systematic account of the subject, progressing from modal logic through to the establishment of an arithmetic interpretation of intuitionistic logic. The presentation is mathematically rigorous but in a style that will appeal to readers from a wide variety of areas to which the theory applies. These include mathematical logic, artificial intelligence, computer science, philosophical logic and epistemology, linguistics, and game theory.

Note: Title from publisher's bibliographic system (viewed on 24 Apr 2019).

Additional Edition: ISBN 1-108-42491-0

Language: English

Subjects: Mathematics

Keywords: Electronic books

URL: Volltext  (lizenzpflichtig)

URL: https://doi.org/10.1017/9781108348034

URL: https://doi.org/10.1017/9781108348034

UID:

Format: XIII, 242 S. : graph. Darst.

ISBN: 3-540-97233-1 , 0-387-97233-1

Series Statement: Texts and monographs in computer science

Note: WST: First-order logic and automated theorem proving

Language: English

Subjects: Computer Science , Mathematics

Keywords: Prädikatenlogik ; Stufe 1 ; Automatisches Beweisverfahren ; Automatisches Beweisverfahren ; Mathematische Logik

UID:

Format: 191 S.

ISBN: 0-7204-2256-6

Series Statement: Studies in logic and the foundations of mathematics

Language: English

Subjects: Mathematics

Keywords: Intuitionistische Logik ; Modelltheorie ; Mathematische Logik ; Mengenlehre

UID:

Format: XIII, 288 S. : graph. Darst.

ISBN: 0-19-852395-5

Series Statement: Oxford logic guides 34

Language: English

Subjects: Mathematics

Keywords: Mengenlehre ; Kontinuumshypothese ; Kontinuumshypothese

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007811385&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: Inhaltstext

URL: Verlagsangaben

URL: http://www.loc.gov/catdir/enhancements/fy0635/96025735-t.html

Author information: Smullyan, Raymond M. 1919-2017

UID:

Format: 1 online resource (193 pages)

ISBN: 1-283-52641-7 , 9786613838865 , 0-08-095773-0

Series Statement: Studies in logic and the foundations of mathematics ; v. 54

Note: Front Cover; Intuitionistic Logic Model Theory and Forcing; Copyright Page; Contents; Acknowledgments; Introduction; PART I: LOGIC; Chapter 1. Propositional intuitionistic logic. semantics; 1. Formulas; 2. Models and validity; 3. Motivation; 4. Some properties of models; 5. Algebraic models; 6. Equivalence of algebraic and Kripke validity; Chapter 2. Propositional intuitionistic logic. proof theory; 1. Beth tableaus; 2. Correctness of Beth tableaus; 3. Hintikka collections; 4. Completeness of Beth tableaus; 5. Examples; Chapter 3. Related systems of logic , 2. Correctness of Beth tableaus 3. Hintikka collections; 4. Hintikka elements; 5. Completeness of Beth tableaus; 6. Second completeness proof for Beth tableaus; 7. An axiom system, A1; 8. A second axiom system. A2; 9. Correctness of the system A2; 10. Completeness of the system A1; Chapter 6. Additional fist order results; 1. Compactness; 2. Concerning the excluded middle law; 3. Skolem-Löwenheim; 4. Kleene tableaus; 5. Craig interpolation lemma; 6. Models with constant B function; PART II: SET THEORY; Chapter 7. Intuitionistic Ma generalizations , 1. Introduction 2. The classical Ma sequence; 3. The intuitionistic Ma sequence; 4. Dominance; 5. A little about equality; 6. Weak substitutivity of equality; 7. More on dominance; 8. Axiom of extensionality; 9. Null set axiom; 10. Unordered pairs axiom; 11. Union axiom; 12. Axiom of infinity; 13. Axiom of regularity; 14. Definability of the models; 15. Power set axiom; 16. X-equivalence; 17. Axiom of substitution; Chapter 8. Independence of the axiom of choice; 1. The specific model; 2. Symmetries; 3. Functions; 4. Axiom of choice , Chapter 9. Ordinals and cardinals 1. Definitions; 2. Some properties of ordinals; 3. General ordinal representatives; 4. Canonical ordinal representatives; 5. Ordinalized models; 6. Properties of ordinal representatives; 7. Types of ordinals; 8. Cardinalized models; 9. Countably incompatible G; Chapter 10. Independence of the continuum hypothesis; 1. The specific model; 2. Countable incompatibility of W; 3. Cardinals and W; 4. Continuum hypothesis; Chapter 11. Definability and constructability; 1.Definitions; 2. Adequacy of the definability formula; 3. ?-dominance , English

Additional Edition: ISBN 0-444-53418-0

Language: English

UID:

Format: XX, 307 S.

ISBN: 0-444-86171-8

Series Statement: Studies in logic and the foundations of mathematics 105

Language: English

Subjects: Mathematics

Keywords: Rekursionstheorie

URL: Inhaltsverzeichnis

UID:

Format: VIII, 555 S.

ISBN: 90-277-1573-4

Series Statement: Synthese library 169

Language: English

Subjects: Mathematics , Philosophy

Keywords: Modallogik ; Beweis ; Intuitionistische Logik ; Beweis

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=000067969&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: Cover

UID:

Format: 1 online resource (329 p.)

ISBN: 0-08-096031-6

Series Statement: Studies in logic and the foundations of mathematics ; v. 105

Content: This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods in partition calculus includes a section on topology with Arhangel'skii's famous result that a first countable compact Hausdorff space has cardinality, at most continuum. Several sections on set mappings are included as well as an account of r

Note: Description based upon print version of record. , Front Cover; Fundamentals of Generalized Recursion Theroy; Copyright Page; Introduction; Contents; Chapter 1. Recursion and ω-recursion Theories; 1. Introduction; 2. Structures; 3. Elementary formal systems; 4. Examples; 5. Remarks; 6. Informal motivation; 7. Enumeration operators; 8. Informal motivation; 9. ω-elementary formal systems; 10. Basic structural properties; 11. Recursion and ω-recursion theories; 12. The least fixed point theorem; 13. Inductive definability; 14. R -definability; Chapter 2. Production Systems; 1. Introduction; 2. Production systems; 3. Elementary results , 4. Reducibility5. Pointwise generated functions; 6. Production systems with equality; 7. Closure under least fixed point; 8. A Kleene-Post result; Chapter 3. Embeddings; 1. Introduction; 2. Codings; 3. Pre-embeddings; 4. Embeddings and co-embeddings; 5. Theory assignments; 6. Examples; 7. The category of production systems; Chapter 4. Combining Production Systems; 1. Introduction; 2. Combining domains and codings; 3. Symmetric monoidal categories; 4. A few technical results; 5. Combining structures; 6. Recursion theories, for example; 7. Combining production systems; 8. Combining embeddings , 9. Monoidal subcategories in Prod10. Separability; 11. A few results about separability; 12. Injections and co-embeddings; Chapter 5. Effective Embeddings; 1. Introduction; 2. Effective embeddings; 3. Results about effective embeddings; 4. Reflexivity; 5. An "effective" symmetric monoidal category; 6. Extensions; 7. Isomorphisms; Chapter 6. Indexed Recursion and ω-recursion Theories; 1. Introduction; 2. Elaborating a structure; 3. Recursion and ω-recursion theories; 4. Σ completeness; 5. Elementary formal systems and Σ completeness; 6. Separability; 7. Reflexivity; 8. Sequence codings , 9. Adding letters10. Copies and extensions; 11. Universal machines; 12. Operator indexing; 13. Input and output place-fixing theorems; 14. Indexing revisited; 15. Relational indexing; 16. Finite codes; Chapter 7. Indexed Relational Systems; 1. Introduction; 2. Immediate consequences; 3. Fixed point theorems; 4. Rice's theorem; 5. Creative sets; 6. Kleene-Mostowski systems; 7. The Rice-Shapiro theorem; Chapter 8. Indexed Production Systems; 1. Introduction; 2. Indexed production systems; 3. The output place-fixing property; 4. The input place-fixing property , 5. Pointwise generated functions, again6. D-finiteness; 7. Rogers' form for operators; 8. Effective pairing; 9. Non-compact operators; 10. All the D-finiteness assumptions together; 11. The least fixed point theorem; 12. Metacompactness; 13. Semi-hyperregularity; 14. Compact cores; 15. The least fixed point theorem, again; Chapter 9. Admissible Set Recursion Theories; 1. Introduction; 2. Admissible sets; 3. Terminology; 4. Elementary formal systems over admissible sets; 5 . Basic results; 6. Examples; 7. Enumeration operators generalized; 8. Structural properties; 9. More examples , 10. Pre-embeddings and embeddings , English

Additional Edition: ISBN 1-299-77348-6

Additional Edition: ISBN 0-444-86171-8

Language: English