Fermilab Fermilab Core Computing Division

Library Home |  Ask a Librarian library@fnal.gov |  Book Catalog |  Library Journals |  Requests |  SPIRES |  Fermilab Documents |

Fermilab Library
SPIRES-BOOKS: FIND KEYWORD MATHEMATICAL LOGIC AND FORMAL LANGUAGES *END*INIT* use /tmp/qspiwww.webspi1/4794.56 QRY 131.225.70.96 . find keyword mathematical logic and formal languages ( in books using www Cover
Image
Call number:SPRINGER-2016-9789462392045:ONLINE Show nearby items on shelf
Title:Type Systems for Distributed Programs: Components and Sessions
Author(s): Ornela Dardha
Date:2016
Size:1 online resource (4 p.)
Note:10.2991/978-94-6239-204-5
Contents:1.Background on Components -- 2. A Type System for Components -- 3. Properties of the Type System -- 4.Background on π- Types -- 5. Background on Session Types -- 6. Session Types Revisited -- 7. Subtyping -- 8. Polymorphism -- 9.Higher-Order Comm unication -- 10.Recursion -- 11.From π- Types to Session Types -- 12. Background on π- types for Lock Freedom -- 13 Background on Session Types for Progress -- 14 Progress as Compositional Lock Freedom.
ISBN:9789462392045
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Atlantis Studies in Computing: 7
Keywords: Computer science , Mathematical logic , Computer Science , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319318035:ONLINE Show nearby items on shelf
Title:Dependence Logic Theory and Applications
Author(s):
Date:2016
Size:1 online resource (276 p.)
Note:10.1007/978-3-319-31803-5
Contents:Introduction -- Durand, Kontinen, Vollmer, Expressivity and Complexity of Dependence Logic -- Väänänen, Grelling on Dependence -- Galliani, On Strongly First-Order Dependencies -- Grädel, Games for Inclusion Logic and Fixed-Point Logic -- Hodge s, Remarks on Compositionality -- Hirvonen, Independence in Model Theory -- Ciardelli, Dependency as Question Entailment -- Link, Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data -- Nyman, Pensar, Corander, Context-Specific and Local Independence in Markovian Dependence Structures -- Pacuit, Fang, Dependence and Independence in Social Choice: Arrow's Theorem -- Blass, Introduction to Secret-Sharing
ISBN:9783319318035
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Logic , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages , Logic
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319226866:ONLINE Show nearby items on shelf
Title:Advances in Proof-Theoretic Semantics
Author(s):
Date:2016
Edition:1st ed. 2016
Size:1 online resource (283 p.)
Note:10.1007/978-3-319-22686-6
Contents:Chapter 1. Introduction Thomas Piecha & Peter-Schroeder-Heister -- Chapter 2. On Brouwer-Heyting-Kolmogorov provability semantics Sergei N. Artëmov -- Chapter 3. Two Ways of General Proof Theory Kosta Došen -- Chapter 4. Generalised elimination ru les Roy Dyckhoff -- Chapter 5. On the proof theoretic foundations of set theory Lars Hallnäs -- Chapter 6. The choice of semantics as a methodological question Wilfrid Hodges -- Chapter 7. The mode of presentation Reinhard Kahle -- Chapter 8. Remarks on relations between Gentzen and Heyting inspired PTS Dag Prawitz -- Chapter 9. Unification of logics by reflection Giovanni Sambin -- Chapter 10. BHK and Brouwer's Theory of the Creative Subject Göran Sundholm -- Chapter 11. Compositional semantics for pre dicate logic: Eliminating bound variables from formulas and deductions William W. Tait -- Chapter 12. Intuitionism, the Paradox of Knowability and Empirical Negation Gabriele Usberti -- Chapter 13. Explicit composition and its application in
normalization proofs Jan von Plato -- Chapter 14. A two-sorted typed lambda-calculus Heinrich Wansing -- Chapter 15. Kreisel's second clause and the Theory of Constructions Walter Dean & Hidenori Kurokawa -- Chapter 16. On Paradoxes in Proof-Theoret ic Semantics Yoshihiro Maruyama
ISBN:9783319226866
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Trends in Logic, Studia Logica Library: 43
Keywords: Philosophy , Logic , Mathematical logic , Philosophy , Logic , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2010-9781441906151:ONLINE Show nearby items on shelf
Title:A Course in Mathematical Logic for Mathematicians [electronic resource]
Author(s): Yu. I Manin
Date:2010
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:A Course in Mathematical Logic for Mathematicians, Second Edition offers a straightforward introduction to modern mathematical logic that will appeal to the intuition of working mathematicians. The book begins with an elementaryintroduction to formal languages and proceeds to a discussion of proof theory. It then presents several highlights of 20th century mathematical logic, including theorems of Gdel and Tarski, and Cohen's theorem on the independence ofthe continuum hypothesis. A unique feature of the text is a discussion of quantum logic. The exposition then moves to a discussion of computability theory that is based on the notion of recursive functions and stresses number-theoreticconnections. The text present a complete proof of the theorem of DavisPutnamRobinsonMatiyasevich as well as a proof of Higman's theorem on recursive groups. Kolmogorov complexity is also treated. Part III establishes theessential equivalence of proof theory and computation theory and gives applications such as Gdel's t heorem on the length of proofs. A new Chapter IX, written by Yuri Manin, treats, among other things, a categorical approach to thetheory of computation, quantum computation, and the P/NP problem. A new Chapter X, written by Boris Zilber, contains basic re sults of model theory and its applications to mainstream mathematics. This theory has found deep applicationsin algebraic and diophantine geometry. Yuri Ivanovich Manin is Professor Emeritus at Max-Planck-Institute for Mathematics in Bonn, Germany, Board of Trustees Professor at the Northwestern University, Evanston, IL, USA, and PrincipalResearcher at the Steklov Institute of Mathematics, Moscow, Russia. Boris Zilber, Professor of Mathematical Logic at the University of Oxford, has contributed the Model Theory Chapter for the second edition
Note:Springer eBooks
Contents:Preface to the Second Edition
Preface to the First Edition
Introduction to Formal Languages
Truth and Deducibility. The Continuum Problem and Forcing
The Continuum Problem and Constructible Sets
Recursive Functions and Church's Thesis
Diophantine Sets and Algorithmic Undecidability
Gdel's Incompleteness Theorem
Recursive Groups
Constructive Universe and Computation
Model Theory
Suggestions for Further Reading
Index
ISBN:9781441906151
Series:e-books
Series:SpringerLink (Online service)
Series:Graduate Texts in Mathematics, 0072-5285 : v53
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Logic , Logic, Symbolic and mathematical
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2008-9783764385187:ONLINE Show nearby items on shelf
Title:Completeness Theory for Propositional Logics [electronic resource]
Author(s): Witold A Pogorzelski
Piotr Wojtylak
Date:2008
Publisher:Basel : Birkhuser Basel
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The book develops the theory of one of the most important notions in the methodology of formal systems. Particularly, completeness plays an important role in propositional logic where many variants of the notion have been defined.Global variants of t he notion mean the possibility of getting all correct and reliable schemata of inference. Its local variants refer to the notion of truth given by some semantics. A uniform theory of completeness in its general andlocal meaning is carried out and it gener alizes and systematizes some variety of the notion of completeness such as Post-completeness, structural completeness and many others. This approach allows also for a more profound view uponsome essential properties (e.g. two-valuedness) of propositional systems. For these purposes, the theory of logical matrices, and the theory of consequence operations is exploited
Note:Springer eBooks
Contents:Introduction
1. Basic notions: Propositional languages
Abstract algebras
Preliminary lattice
theoretical notions
Propositional logics
Brief exposition of the most important propositional logics
2. Semantic methods in propositional logic: Preordered sets
Preordered algebras
Logical matrices
Adequacy
Propositional logic and lattice theory
3. Completeness of propositional logic: Generalized completeness
Post
completeness
The problem of uniqueness of Lindenbaum extensions
Some related concepts
4. Characterization of propositional connectives: Cn
definit
ISBN:9783764385187
Series:e-books
Series:SpringerLink (Online service)
Series:Studies in Universal Logic
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Logic, Symbolic and mathematical
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2008-9780817647636:ONLINE Show nearby items on shelf
Title:Logic for Computer Scientists [electronic resource]
Author(s): Uwe Schning
Date:2008
Publisher:Boston, MA : Birkhuser Boston
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. It presents applications and themes of computerscience research such as resolution, automated deduction, and logic programming in a rigorous but readable way. The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advancedundergraduate course in logic for compute r scientists. This is a short introductory book on the topic of propositional and first-order logic, with a bias towards computer scientists. Schning decides to concentrate on computationalissues, and gives us a short book (less than 170 pages) with a tig ht storyline. I found this a nicely written book with many examples and exercises (126 of them). The presentation is natural and easy to follow. This book seemssuitable for a short course, a seminar series, or part of a larger course on Prolog and logic p rogramming, probably at the advanced undergraduate level. SIGACT News Contains examples and 126 interesting exercises which put thestudent in an active reading mode.... Would provide a good university short course introducing computer science students to theorem proving and logic programming. Mathematical Reviews This book concentrates on those aspects ofmathematical logic which have strong connections with different topics in computer science, especially automated deduction, logic programming, program verification and semantics of programming languages.... The numerous exercises andillustrative examples contribute a great extent to a better understanding of different concepts and results. The book can be successfully used as a handbook for an introduct ory course in artificial intelligence. Zentralblatt MATH
Note:Springer eBooks
Contents:Introduction
Propositional Logic
Predicate Logic
Logic Programming
Bibliography
Table of Notations
Index
ISBN:9780817647636
Series:e-books
Series:SpringerLink (Online service)
Series:Progress in Computer Science and Applied Logic (PCS) : v8
Series:Mathematics and Statistics (Springer-11649)
Keywords: Computer science , Logic, Symbolic and mathematical
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2003-9783540447610:ONLINE Show nearby items on shelf
Title:Set Theory
Author(s): Thomas Jech
Date:2003
Edition:The Third Millennium Edition
Size:1 online resource (772 p.)
Note:10.1007/3-540-44761-X
Contents:Basic Set Theory -- Axioms of Set Theory -- Ordinal Numbers -- Cardinal Numbers -- Real Numbers -- The Axiom of Choice and Cardinal Arithmetic -- The Axiom of Regularity -- Filters, Ultrafilters and Boolean Algebras -- Stationary Sets
-- Combinatorial Set Theory -- Measurable Cardinals -- Borel and Analytic Sets -- Models of Set Theory -- Advanced Set Theory -- Constructible Sets -- Forcing -- Applications of Forcing -- Iterated Forcing and Martin’s Axiom -- Large
Cardinals -- Large Cardinals and L -- Iterated Ultrapowers and L[U] -- Very Large Cardinals -- Large Cardinals and Forcing -- Saturated Ideals -- The Nonstationary Ideal -- The Singular Cardinal Problem -- Descriptive Set Theory -- The
Real Line -- Selected Topics -- Combinatorial Principles in L -- More Applications of Forcing -- More Combinatorial Set Theory -- Complete Boolean Algebras -- Proper Forcing -- More Descriptive Set Theory -- Determinacy -- Supercompact
Cardinals and the Real Line -- Inner Models for Large Cardinals -- Forcing and Large Cardinals -- Martin’s Maximum -- More on Stationary Sets
ISBN:9783540447610
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2002-9783540457145:ONLINE Show nearby items on shelf
Title:Substitutions in Dynamics, Arithmetics and Combinatorics
Author(s):
Date:2002
Size:1 online resource (404 p.)
Note:10.1007/b13861
Contents:Basic notions on substitutions -- Basic notions on substitutions -- Arithmetics and combinatorics of substitutions -- Substitutions, arithmetic and finite automata: an introduction -- Automatic sequences and transcendence --
Substitutions and partitions of the set of positive integers -- Dynamics of substitutions -- Substitutions and symbolic dynamical systems -- Sturmian Sequences -- Spectral theory and geometric representation of substitutions --
Diophantine approximations, substitutions, and fractals -- Extensions to free groups and interval transformations -- Infinite words generated by invertible substitutions -- Polynomial dynamical systems associated with substitutions --
Piecewise linear transformations of the unit interval and Cantor sets -- Some open problems -- A. Undecomposable matrices in dimension 3 (by J. Rivat)
ISBN:9783540457145
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 1794
Keywords: Mathematics , Computers , Mathematical logic , Dynamics , Ergodic theory , Functions of real variables , Sequences (Mathematics) , Number theory , Mathematics , Number Theory , Real Functions , Dynamical Systems and Ergodic Theory , Sequences, Series, Summability , Computation by Abstract Devices , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2002-9781447101093:ONLINE Show nearby items on shelf
Title:Diagrammatic Representation and Reasoning
Author(s):
Date:2002
Size:1 online resource (584 p.)
Note:10.1007/978-1-4471-0109-3
Contents:I. Views of Diagrams -- 1. Diagrams in the Mind? -- 2. Knowing About Diagrams -- 3. A Meta-Taxonomy for Diagram Research -- 4. Sketches as Mental Reifications of Theoretical Scientific treatment -- 5. The Fundamental Design Variables
of Diagramming -- II. Cognitive Aspects of Diagrams -- 6. Psychological Perspectives on Diagrams and their Users. -- 7. Combining Semantic and Cognitive Accounts of Diagrams -- 8. Tactile Maps and a Test of the Conjoint Retention
Hypothesis -- 9. Spatial Abilities in Problem Solving in Kinematics -- 10. Graph Comprehension: The Role of Format, Content and Individual Differences -- 11. Graphs in Print -- 12. The Role of Representation and Working Memory in
Diagrammatic Reasoning and Decision Making -- 13. Mechanical Reasoning about Gear-and-belt Diagrams. Do Eye-movements Predict Performance? -- 14. How do Designers Shift their Focus of Attention in their Own Sketches? -- III. Formal
Aspects of Diagrammatic Reasoning -- 15. Diagrammatic Evaluation of Visual Mathematical Notations -- 16. A Topological Framework for Modelling Diagrammatic Reasoning Tasks -- 17. Multiple Readings of Peirce’s Alpha Graphs -- 18. On
Automating Diagrammatic Proofs of Arithmetic Arguments -- 19. On the Practical Semantics of Mathematical Diagrams -- 20. EnE Sentences and Local Extent in Diagrams -- 21. Implementing Euler/Venn Reasoning Systems -- 22. Visual Spatial
Query Languages: A Semantics Using Description Logic -- IV. Applications of Diagrammatic Reasoning -- 23. Intelligent Diagrammatic Interfaces: State of the Art -- 24. Towards Diagram Processing: A Diagrammatic Information System -- 25.
Using Diagrams to Understand Diagrams: A Case-Based Approach to Diagrammatic Reasoning -- 26. Interpreting the Engineer’s Sketch: A Picture is Worth a Thousand Constraints -- 27. Diagramming Research Designs -- 28. How to Build a
(Quite General) Linguistic Diagram Editor -- 29. AVOW Diagrams: A Novel Representational System for Understanding Electricity -- 30. AsbruView: Capturing Complex, Time-Oriented Plans - Beyond Flow Charts -- 31. Acting with Diagrams:
How to Plan Strategies in Two Case Studies -- 32. Specifying Diagram Languages by Means of Hypergraph Grammars
ISBN:9781447101093
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Logic , Artificial intelligence , Applied mathematics , Engineering mathematics , Mathematics , Applications of Mathematics , Artificial Intelligence (incl. Robotics) , Logic
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9789401596343:ONLINE Show nearby items on shelf
Title:Where Mathematics, Computer Science, Linguistics and Biology Meet Essays in honour of Gheorghe Păun
Author(s):
Date:2001
Size:1 online resource (446 p.)
Note:10.1007/978-94-015-9634-3
Contents:1 The Games of His Life -- I Grammars and Grammar Systems -- 2 Deterministic Stream X-Machines Based on Grammar Systems -- 3 Some Ghosts that Arise in a Spliced Linguistic String: Evidence from Catalan -- 4 On Size Complexity of
Context-Free Returning Parallel Communicating Grammar Systems -- 5 Subregularly Controlled Derivations: Restrictions by Syntactic Parameters -- 6 Neo-Modularity and Colonies -- 7 Sewing Contexts and Mildly Context-Sensitive Languages
-- 8 Towards Grammars of Decision Algorithms -- II Automata -- 9 Computational Complementarity for Probabilistic Automata -- 10 Acceptance of ?-Languages by Communicating Deterministic Turing Machines -- 11 Counter Machines and the
Safety and Disjointness Problems for Database Queries with Linear Constraints -- 12 Automata Arrays and Context-Free Languages -- 13 On Special Forms of Restarting Automata -- 14 The Time Dimension of Computation Models -- III
Languages and Combinatorics -- 15 An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy -- 16 Trellis Languages -- 17 Pictures, Layers, Double Stranded Molecules: On Multi-Dimensional Sentences --
18 Transduction in Polypodes -- 19 Some Algebraic Properties of Contexts and Their Applications to Contextual Languages -- 20 On Fatou Properties of Rational Languages -- 21 Multiple Keyword Patterns in Context-Free Languages -- 22
Reading Words in Graphs Generated by Hyperedge Replacement -- 23 Regularly Controlled Formal Power Series -- 24 Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks -- 25 Approximate Identification and Finite
Elasticity -- 26 Insertion of Languages and Differential Semirings -- IV Models of Molecular Computing -- 27 Molecular Structures -- 28 A Characterization of Non-Iterated Splicing with Regular Rules -- 29 Universal and Simple
Operations for Gene Assembly in Ciliates -- 30 Semi-Simple Splicing Systems -- 31 Writing By Methylation Proposed For Aqueous Computing -- 32 Context-Free Recombinations -- 33 Simplified Simple H Systems -- 34 On Some Forms of Splicing
-- 35 Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages -- 36 On Membrane Computing Based on Splicing -- 37 Is Evolutionary Computation Using DNA Strands Feasible? -- 38 Splicing Systems Using
Merge and Separate Operations
ISBN:9789401596343
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , History , Computer science , Artificial intelligence , Mathematical logic , Combinatorics , Computational linguistics , Mathematics , Mathematical Logic and Foundations , History of Science , Mathematics of Computing , Combinatorics , Artificial Intelligence (incl. Robotics) , Computational Linguistics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9783662043356:ONLINE Show nearby items on shelf
Title:Soft Computing Integrating Evolutionary, Neural, and Fuzzy Systems
Author(s): Andrea Tettamanzi
Date:2001
Size:1 online resource (328 p.)
Note:10.1007/978-3-662-04335-6
Contents:1 Evolutionary Algorithms -- 2 Artificial Neural Networks -- 3 Fuzzy Systems -- 4 Evolutionary Design of Artificial Neural Networks -- 5 Evolutionary Design of Fuzzy Systems -- 6 Neuro-fuzzy Systems -- 7 Fuzzy Evolutionary Algorithms
-- 8 Natural Parallel (Soft) Computing -- 9 Epilogue
ISBN:9783662043356
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Computers , Algorithms , Mathematical logic , Artificial intelligence , Complexity, Computational , Mathematics , Mathematical Logic and Foundations , Artificial Intelligence (incl. Robotics) , Computation by Abstract Devices , Algorithm Analysis and Problem Complexity , Mathematical Logic and Formal Languages , Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9781461300892:ONLINE Show nearby items on shelf
Title:Automated Theorem Proving Theory and Practice
Author(s): Monty Newborn
Date:2001
Size:1 online resource (231 p.)
Note:10.1007/978-1-4613-0089-2
Contents:A brief introduction to COMPILE, HERBY and THEO -- Predicate calculus, well-formed formulas and theorems -- COMPILE: transforming well-formed formulas to clauses -- Inference procedures -- Proving theorems by constructing closed
semantic trees -- Resolution-refutation proofs -- HERBY: A semantic tree theorem prover -- Using HERBY -- THEO: A resolution-refutation theorem prover -- Using THEO -- A look at HERBY's source code -- A look at THEO's source code --
Other theorem provers -- References
ISBN:9781461300892
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical logic , Artificial intelligence , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages , Artificial Intelligence (incl. Robotics)
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9781461201717:ONLINE Show nearby items on shelf
Title:Automata Theory and its Applications
Author(s): Bakhadyr Khoussainov
Date:2001
Size:1 online resource (432 p.)
Note:10.1007/978-1-4612-0171-7
Contents:1. Basic Notions -- 1.1 Sets -- 1.2 Sequences and Tuples -- 1.3 Functions, Relations, Operations -- 1.4 Equivalence Relations -- 1.5 Linearly Ordered Sets -- 1.6 Partially Ordered Sets -- 1.7 Graphs -- 1.8 Induction -- 1.9 Trees and
König’s Lemma -- 1.10 Countable and Uncountable Sets -- 1.11 Algorithms -- 2 Finite Automata -- 2.1 Two Examples -- 2.2 Finite Automata -- 2.3 Closure Properties -- 2.4 The Myhill—Nerode Theorem -- 2.5 The Kleene Theorem -- 2.6
Generalized Finite Automata -- 2.7 The Pumping Lemma and Decidability -- 2.8 Relations and Finite Automata -- 2.9 Finite Automata with Equations -- 2.10 Monadic Second Order Logic of Strings -- 3 Büchi Automata -- 3.1 Two Examples --
3.2 Büchi Automata -- 3.3 The Büchi Theorem -- 3.4 Complementation for Büchi Automata -- 3.5 The Complementation Theorem -- 3.6 Determinism -- 3.7 Müller Automata -- 3.8 The McNaughton Theorem -- 3.9 Decidability -- 3.10 Büchi Automata
and the Successor Function -- 3.11 An Application of the McNaughton Theorem -- 4 Games Played on Finite Graphs -- 4.1 Introduction -- 4.2 Finite Games -- 4.3 Infinite Games -- 4.4 Update Games and Update Networks -- 4.5 Solving Games
-- 5 Rabin Automata -- 5.1 Rabin Automata -- 5.2 Special Automata -- 5.3 Game Automata -- 5.4 Equivalence of Rabin and Game Automata -- 5.5 Terminology: Arenas, Games, and Strategies -- 5.6 The Notion of Rank -- 5.7 Open Games -- 5.8
Congruence Relations -- 5.9 Sewing Theorem -- 5.10 Can Mr. (?) Visit C Infinitely Often? -- 5.11 The Determinacy Theorem -- 5.12 Complementation and Decidability -- 6 Applications of Rabin Automata -- 6.1 Structures and Types -- 6.2
The Monadic Second Order Language -- 6.3 Satisfiability and Theories -- 6.4 Isomorphisms -- 6.5 Definability in T and Decidability of S2S -- 6.6 The Structure with ? Successors -- 6.7 Applications to Linearly Ordered Sets -- 6.8
Application to Unary Algebras -- 6.9 Applications to Cantor’s Discontinuum -- 6.10 Application to Boolean Algebras
ISBN:9781461201717
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Progress in Computer Science and Applied Logic : 21
Keywords: Mathematics , Software engineering , Computers , Mathematical logic , Artificial intelligence , Mathematics , Mathematical Logic and Foundations , Artificial Intelligence (incl. Robotics) , Software Engineering/Programming and Operating Systems , Theory of Computation , Computation by Abstract Devices , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9781447136576:ONLINE Show nearby items on shelf
Title:Discrete Mathematics Using a Computer
Author(s): Cordelia Hall
Date:2000
Size:1 online resource (339 p.)
Note:10.1007/978-1-4471-3657-6
Contents:1 Introduction to Haskell -- 2 Propositional Logic -- 3 Predicate Logic -- 4 Set Theory -- 5 Recursion -- 6 Inductively Defined Sets -- 7 Induction -- 8 Relations -- 9 Functions -- 10 Discrete Mathematics in Circuit Design -- A
Software Tools for Discrete Mathematics -- B Resources on the Web -- C Solutions to Selected Exercises -- C.1 Introduction to Haskell -- C.2 Propositional Logic -- C.3 Predicate Logic -- C.4 Set Theory -- C.5 Recursion -- C.6
Inductively Defined Sets -- C.7 Induction -- C.8 Relations -- C.9 Functions -- C.1O Discrete Mathematics in Circuit Design
ISBN:9781447136576
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Mathematical logic , Mathematics , Mathematics, general , Mathematical Logic and Formal Languages , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1997-9783662224007:ONLINE Show nearby items on shelf
Title:Set Theory
Author(s): Thomas Jech
Date:1997
Edition:Second Corrected Edition
Size:1 online resource (634 p.)
Note:10.1007/978-3-662-22400-7
Contents:I Sets -- 1 Axiomatic Set Theory -- 2 Transitive Models of Set Theory -- II More Sets -- 3 Forcing and Generic Models -- 4 Some Applications of Forcing -- III Large Sets -- 5 Measurable Cardinals -- 6 Other Large Cardinals -- IV Sets
of Reals -- 7 Descriptive Set Theory -- Historical Notes and Guide to the Bibliography -- Notation -- Name Index -- List of Corrections
ISBN:9783662224007
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9783709194614:ONLINE Show nearby items on shelf
Title:Collegium Logicum
Author(s):
Date:1996
Size:1 online resource (140 p.)
Note:10.1007/978-3-7091-9461-4
Contents:Resolution Games and Non-liftable Resolution Orderings -- A Tableau Calculus for Partial Functions -- MUltlog: an Expert System for Multiple-valued Logics -- A Fundamental Problem of Mathematical Logic -- On the Lengths of Proofs of
Consistency -- The Craig Interpolation Theorem for Schematic Systems -- The Role of Monotonicity in Descriptive Complexity Theory -- Numbers Defined by Turing Machines
ISBN:9783709194614
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Collegium Logicum, Annals of the Kurt-Gödel-Society: 2
Keywords: Mathematics , Computers , Algorithms , Computer logic , Mathematical logic , Physics , Mathematics , Mathematical Logic and Foundations , Theoretical, Mathematical and Computational Physics , Logics and Meanings of Programs , Mathematical Logic and Formal Languages , Computation by Abstract Devices , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1995-9783709193945:ONLINE Show nearby items on shelf
Title:Collegium Logicum
Author(s):
Date:1995
Size:1 online resource (122 p.)
Note:10.1007/978-3-7091-9394-5
Contents:The Last Months of Gerhard Gentzen in Prague -- Some Issues on Gödel’s Unpubhshed Philosophical Manuscripts -- Vollständigkeit als Ziel historischer Explikation. Eine Fallstudie -- Existenz und Negation in Mathematik und Logik --
Paradoxien der Prognose und der Evaluation: Eine fixpunkttheoretische Analyse -- Automated Deduction and Integer Programming -- Methods of Functional Extension
ISBN:9783709193945
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Collegium Logicum, Annals of the Kurt-Gödel-Society: 1
Keywords: Mathematics , Computers , Algorithms , Computer logic , Mathematical logic , Physics , Mathematics , Mathematical Logic and Foundations , Theoretical, Mathematical and Computational Physics , Logics and Meanings of Programs , Mathematical Logic and Formal Languages , Computation by Abstract Devices , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1995-9783662031827:ONLINE Show nearby items on shelf
Title:Finite Model Theory
Author(s): Heinz-Dieter Ebbinghaus
Date:1995
Size:1 online resource (327 p.)
Note:10.1007/978-3-662-03182-7
Contents:0. Preliminaries -- 1. The Ehrenfeucht-Fraïssé Method -- 2. More on Games -- 3. 0–1 Laws -- 4. Satisfiability in the Finite -- 5. Finite Automata and Logic: A Microcosm of Finite Model Theory -- 6. Descriptive Complexity Theory -- 7.
Logics with Fixed-Point Operators -- 8. Logic Programs -- 9. Optimization Problems -- 10. Quantifiers and Logical Reductions -- References
ISBN:9783662031827
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Algorithm Analysis and Problem Complexity , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1995-9783540287889:ONLINE Show nearby items on shelf
Title:Finite Model Theory
Author(s): Heinz-Dieter Ebbinghaus
Date:1995
Edition:Second Revised and Enlarged Edition 1999
Size:1 online resource (362 p.)
Note:10.1007/3-540-28788-4
Contents:Preliminaries -- The Ehrenfeucht-Fraïssé Method -- More on Games -- 0-1 Laws -- Satisfiability in the Finite -- Finite Automata and Logic: A Microcosm of Finite Model Theory -- Descriptive Complexity Theory -- Logics with Fixed-Point
Operators -- Logic Programs -- Optimization Problems -- Logics for PTIME -- Quantifiers and Logical Reductions
ISBN:9783540287889
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1994-9781475723557:ONLINE Show nearby items on shelf
Title:Mathematical Logic
Author(s): H.-D Ebbinghaus
Date:1994
Edition:Second Edition
Size:1 online resource (291 p.)
Note:10.1007/978-1-4757-2355-7
Contents:A -- I Introduction -- II Syntax of First-Order Languages -- III Semantics of First-Order Languages -- IV A Sequent Calculus -- V The Completeness Theorem -- VI The Löwenheim-Skolem and the Compactness Theorem -- VII The Scope of
First-Order Logic -- VIII Syntactic Interpretations and Normal Forms -- B -- IX Extensions of First-Order Logic -- X Limitations of the Formal Method -- XI Free Models and Logic Programming -- XII An Algebraic Characterization of
Elementary Equivalence -- XIII Lindström’s Theorems -- References -- Symbol Index
ISBN:9781475723557
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematics , Mathematical Logic and Foundations , Mathematics Education
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9789401582322:ONLINE Show nearby items on shelf
Title:Algorithms: Main Ideas and Applications
Author(s): Vladimir Uspensky
Date:1993
Size:1 online resource (270 p.)
Note:10.1007/978-94-015-8232-2
Contents:Notation and Terminology -- 1.0 Preliminary notions of the theory of algorithms: constructive objects and aggregates local properties and local actions -- 1.1 The general notion of an algorithm as an independent (separate) concept --
1.2 Representative computational models -- 1.3 The general notion of a calculus as an independent (separate) concept -- 1.4 Representative generating models -- 1.5 Interrelations between algorithms and calculuses -- 1.6 Time and Space
as complexities of computation and generation -- 1.7 Computable functions and generable sets decidable sets enumerable sets -- 1.8 The concept of a ?-recursive function -- 1.9 Possibility of an arithmetical and even Diophantine
representation of any enumerable set of natural numbers -- 1.10 Construction of an undecidable generable set -- 1.11 Post’s reducibility problem -- 1.12 The concept of a relative algorithm, or an oracle algorithm -- 1.13 The concept of
a computable operation -- 1.14 The concept of a program programs as objects of computation and generation -- 1.15 The concept of a numbering and the theory of numberings -- 1.16 First steps in the invariant, or machine-independent,
theory of complexity of computations -- 1.17 The theory of complexity and entropy of constructive objects -- 1.18 Convenient computational models -- 2.1 Investigations of mass problems -- 2.2 Applications to the foundations of
mathematics: constructive semantics -- 2.3 Applications to mathematical logic: formalized languages of logic and arithmetic -- 2.4 Computable analysis -- 2.5 Numbered structures -- 2.6 Applications to probability theory: definitions of
a random sequence -- 2.7 Applications to information theory: the algorithmic approach to the concept of quantity of information -- 2.8 Complexity bounds for particular problems -- 2.9 Influence of the theory of algorithms on
algorithmic practice -- Appendix. Probabilistic Algorithms (How the Use of Randomness Makes Computations Shorter) -- A.1 Preliminary remarks -- A.2 Main results -- A.3 Formal definitions -- References -- Author Index
ISBN:9789401582322
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Mathematics and Its Applications : 251
Keywords: Mathematics , Logic , Computers , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Theory of Computation , Logic
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9781461203254:ONLINE Show nearby items on shelf
Title:Logical Methods In Honor of Anil Nerode’s Sixtieth Birthday
Author(s):
Date:1993
Size:1 online resource (816 p.)
Note:10.1007/978-1-4612-0325-4
Contents:The Work of Anil Nerode: A Retrospective -- Embedding Distributive Lattices Preserving 1 Below A Nonzero Recursively Enumerable Turing Degree -- Prime Isols and the Theorems of Fermat and Wilson -- Problem Solving Strategies for the
Derivation of Programs -- Effective Real Dynamics -- An Integer Lattice Arising in the Model Theory of Wreath Products -- Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities -- Extracting Programs from
Proofs by an Extension of the Curry-Howard Process -- A Bird’s-Eye View of Twilight Combinatorics -- Effectively and Noneffectively Nowhere Simple Subspaces -- Index Sets in Recursive Combinatorics -- Computability in Unitary
Representations of Compact Groups -- Recursive Properties of Intervals of Recursive Linear Orders -- Algorithmic Stability of Models -- The Combinatorics of the Friedberg-Muchnick Theorem -- Partial Automata and Finitely Generated
Congruences: An Extension of Nerode’s Theorem -- Minimal Pair Constructions and Iterated Trees of Strategies -- Intuitionistic L -- n-Recursive Linear Orders Without (n + 1)-Recursive Copies -- Multiple Agent Autonomous Control — A
Hybrid Systems Architecture -- Distributed Concurrent Programs as Strategies in Games -- Dempster-Shafer Logic Programs and Stable Semantics -- Who Put the “Back” in Back-and-Forth? -- Polynomial Time Categoricity and Linear Orderings
-- The Disjunction and Numerical Existence Properties for Intuitionistic Analysis -- On the Strength of Fraïssé’s Conjecture
ISBN:9781461203254
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Progress in Computer Science and Applied Logic : 12
Keywords: Computer science , Computer logic , Mathematical logic , Computer science , Applied mathematics , Engineering mathematics , Computer Science , Math Applications in Computer Science , Applications of Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages , Logics and Meanings of Programs
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1992-9783662084946:ONLINE Show nearby items on shelf
Title:Many-Valued Logics 1: Theoretical Foundations
Author(s): Leonard Bolc
Date:1992
Size:1 online resource (288 p.)
Note:10.1007/978-3-662-08494-6
Contents:1 Preliminaries -- 2 Many-Valued Propositional Calculi -- 3 Survey of Three-Valued Propositional Calculi -- 4 Some n-valued Propositional Calculi: A Selection -- 5 Intuitionistic Propositional Calculus -- 6 First-Order Predicate
Calculus for Many-Valued Logics -- 7 The Method of Finitely Generated Trees in n-valued Logical Calculi -- 8 Fuzzy Propositional Calculi -- 9 Approximation Logics -- 10 Probability Logics -- References -- Index of Symbols -- Author
Index
ISBN:9783662084946
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Computer logic , Mathematical logic , Artificial intelligence , Mathematics , Mathematical Logic and Foundations , Logics and Meanings of Programs , Artificial Intelligence (incl. Robotics) , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1992-9781461228226:ONLINE Show nearby items on shelf
Title:Logic from Computer Science Proceedings of a Workshop held November 13–17, 1989
Author(s):
Date:1992
Size:1 online resource (608 p.)
Note:10.1007/978-1-4612-2822-6
Contents:Preface -- The Imperative Future: Past Successes Future Actions -- A Logical Operational Semantics of Full Prolog: Part III. Built-in Predicates for Files, Terms, Arithmetic and Input-Output -- Computability and Complexity of Higher
Type Functions -- Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transfomrations -- Logics for Termination and Correctness of Functional Programs -- Transparent Grammars -- Designing Unification
Procedures Using Transformations: A survey -- NormaL Forms and Cut-Free Proofs as Natural Transformations -- Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems -- 0–1 Laws for Fragments of Second-Order
Logic: an Overview -- No Counter-Example Interpretation and Interactive Computation -- Semantic Characterizations of Number Theories -- Constructive Kripke Semantics and Realizability -- Splitting and Density for the Recursive Sets of
a Fixed Time Complexity -- Reals and Forcing with an Elementary Topos -- Completeness Theorems for Logics of Feature Structures -- Concurrent Programs as Strategies in Games -- Finite and Infinite Dialogues -- Some Relations Between
Subsystems of Arithmetic and Complexity of Computations -- Logics for Negation as Failure -- Normal Varieties of Combinators -- Complexity of Proofs in Classical Propositional Logic
ISBN:9781461228226
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Mathematical Sciences Research Institute Publications: 21
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1990-9783540471356:ONLINE Show nearby items on shelf
Title:Logic and Computer Science Lectures given at the 1st Session of the Centro Internazionale Matematico Estivo (C.I.M.E.) held at Montecatini Terme, Italy, June 20–28, 1988
Author(s): Steven Homer
Date:1990
Size:1 online resource (170 p.)
Note:10.1007/BFb0093921
Contents:The isomorphism conjecture and its generalizations -- Some lectures on intuitionistic logic -- Making computers safe for the world: An introduction to proofs of programs part I -- Prolog Programming -- A guide to polymorphic types
ISBN:9783540471356
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 1429
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1989-9783540482208:ONLINE Show nearby items on shelf
Title:Mathematical Logic and Applications Proceedings of the Logic Meeting held in Kyoto, 1987
Author(s):
Date:1989
Size:1 online resource (226 p.)
Note:10.1007/BFb0083663
Contents:Recursively enumerable sets in models of ?2 collection -- The role of a filter quantifier in set theory -- Syntactical simulation of many-valued logic -- Consistency of Beeson's formal system RPS and some related results -- Elementary
properties of a system of fundamental sequences for ?o -- The continuum hypothesis and the theory of the Kleene degrees -- ?1-Collection and the finite injury priority method -- Computational complexity of languages counting random
oracles -- Infinitesimal calculus interpreted in infinitary logic
ISBN:9783540482208
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 1388
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematics , Mathematical Logic and Foundations , Mathematics Education
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1989-9781461388531:ONLINE Show nearby items on shelf
Title:Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions
Author(s): J. Richard Büchi
Date:1989
Size:1 online resource (316 p.)
Note:10.1007/978-1-4613-8853-1
Contents:1 Concepts and Notations in Discrete Mathematics -- 2 The Structure Theory of Transition Algebras -- 3 The Structure and Behavior of Finite Automata -- 4 Transition Systems and Regular Events -- 5 Regular Canonical Systems -- 6
General Algebras: How They Function as Tree Acceptors and Push-down Automata -- 7 General Alphabets: The Theory of Push-down Automata and Context-free Languages -- Conclusion -- List of Symbols -- References
ISBN:9781461388531
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical logic , Computer mathematics , Combinatorics , Robotics , Automation , Mathematics , Computational Mathematics and Numerical Analysis , Robotics and Automation , Mathematical Logic and Formal Languages , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1977-9781475743852:ONLINE Show nearby items on shelf
Title:A Course in Mathematical Logic
Author(s): Yu. I Manin
Date:1977
Size:1 online resource (288 p.)
Note:10.1007/978-1-4757-4385-2
Contents:I Provability -- I Introduction to formal languages -- II Truth and deducibility -- III The continuum problem and forcing -- IV The continuum problem and constructible sets -- II Computability -- V Recursive functions and Church’s
thesis -- VI Diophantine sets and algorithmic undecidability -- III Provability and Computability -- VII Gödel’s incompleteness theorem -- VIII Recursive groups
ISBN:9781475743852
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Graduate Texts in Mathematics: 53
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1973-9783540368847:ONLINE Show nearby items on shelf
Title:Cambridge Summer School in Mathematical Logic Held in Cambridge/England, August 1–21, 1971
Author(s):
Date:1973
Size:1 online resource (664 p.)
Note:10.1007/BFb0066770
ISBN:9783540368847
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 337
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1969-9783642858208:ONLINE Show nearby items on shelf
Title:Boolean Algebras
Author(s): Roman Sikorski
Date:1969
Edition:Third Edition
Size:1 online resource (240 p.)
Note:10.1007/978-3-642-85820-8
Contents:I. Finite joins and meets -- § 1. Definition of Boolean algebras -- § 2. Some consequences of the axioms -- § 3. Ideals and filters -- § 4. Subalgebras -- § 5. Homomorphisms, isomorphisms -- § 6. Maximal ideals and filters -- § 7. Reduced and perfect fields of sets -- § 8. A fundamental representation theorem -- § 9. Atoms -- § 10. Quotient algebras -- §11. Induced homomorphisms between fields of sets -- § 12. Theorems on extending to homomorphisms -- § 13. Independent subalgebras. Prod ucts -- § 14. Free Boolean algebras -- § 15. Induced homomorphisms between quotient algebras -- § 16. Direct unions -- § 17. Connection with algebraic rings -- II. Infinite joins and meets -- § 18. Definition -- § 19. Algebraic properties of infinit e joins and meets. (m, n)-distributivity. -- § 20. m-complete Boolean algebras -- § 21. m-ideals and m-filters. Quotient algebras -- § 22. m-homomorphisms. The interpretation in Stone spaces -- § 23. m-subalgebras -- § 24. Representations by m-fields of sets
-- § 25. Complete Boolean algebras -- § 26. The field of all subsets of a set -- §27. The field of all Borel subsets of a metric space -- §28. Representation of quotient algebras as fields of sets -- § 29. A fundamental representation theorem f or Boolean ?-algebras. m-representability -- § 30. Weak m-distributivity -- § 31. Free Boolean m-algebras -- § 32. Homomorphisms induced by point mappings -- § 33. Theorems on extension of homomorphisms -- § 34. Theorems on extending to homomorphisms -- § 35. Completions and m-completions -- § 36. Extensions of Boolean algebras -- § 37. m-independent subalgebras. The field m-product -- § 38. Boolean (m, n)-products -- § 39. Relation to other algebras -- § 40. Applications to mathematical logic. Classical calculi -- § 41. Topology in Boolean algebras. Applications to non-classical logic -- § 42. Applications to measure theory -- § 43. Measurable functions and real homomorphisms -- § 44. Measurable functions. Reduction to continuous functions -- §
45. Applications to functional analysis -- § 46. Applications to foundations of the theory of probability -- § 47. Problems of effectivity -- List of symbols -- Author Index
ISBN:9783642858208
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Ergebnisse der Mathematik und ihrer Grenzgebiete: 25
Keywords: Mathematics , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1960-9783662015070:ONLINE Show nearby items on shelf
Title:Boolean Algebras
Author(s): Roman Sikorski
Date:1960
Edition:Second Edition
Size:1 online resource (237 p.)
Note:10.1007/978-3-662-01507-0
Contents:Terminology and notation -- I. Finite joins and meets -- II. Infiinite joins and meets -- Append -- § 39. Relation to other algebras -- § 40. Applications to mathematical logic. Classical calculi -- § 41. Topology in Boolean algebras. Applicatio ns to non-classical logic -- § 42. Applications to measure theory -- § 43. Measurable functions and real homomorphisms -- § 44. Measurable functions. Reduction to continuous functions -- § 45. Applications to functional analysis -- § 46. Applications to foundations of the theory of probability -- § 47. Problems of effectivity -- List of symbols -- Author Index
ISBN:9783662015070
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Ergebnisse der Mathematik und ihrer Grenzgebiete, Unter Mitwirkung der Schriftleitung des „Zentralblatt für Mathematik“ : 25
Keywords: Mathematics , Mathematical logic , Functions of real variables , Mathematics , Real Functions , Mathematics, general , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Return to the Fermilab Library catalog