Automata Studies. (AM-34), Volume 34 / / J. McCarthy, C. E. Shannon |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (297 pages) : illustrations |
Disciplina |
621.38
621.34* |
Collana | Annals of Mathematics Studies |
Soggetto topico |
Machine theory
Conscious automata |
Soggetto non controllato |
A Mathematical Theory of Communication
Abstraction (software engineering) Accuracy and precision Algebraic theory Arithmetic Automaton Axiom Binary number Biophysics Bit Boolean algebra (structure) Calculation Chaos theory Circuit design Classical conditioning Combination lock Combination Computable number Computation Concepts (C++) Conditional probability Connectivity (graph theory) Correlation and dependence Counterexample Counting Decision problem Description number Detection Determinism Deterministic system (philosophy) Diagram (category theory) Diagram Entscheidungsproblem Enumeration Equation Estimation Exponentiation Finite-state machine First principle Fixed point (mathematics) Function (mathematics) Gödel numbering Hardware random number generator Heuristic argument Instance (computer science) Interlacing (bitmaps) Intuitionistic logic Lebesgue measure Logarithm Logic Logical disjunction Markov chain Mathematical analysis Mathematical induction Mathematical logic Mathematical notation Mathematical theory Mathematics Measure (mathematics) Metamathematics Modular arithmetic Moment (mathematics) Moore machine Notation Number theory OR gate Parameter (computer programming) Parity (mathematics) Permutation Pilot plant Polynomial Primitive recursive function Probability measure Probability Proportionality (mathematics) Propositional function Quantity Recursion (computer science) Recursive set Recursively enumerable set Result Schematic Sequence Series (mathematics) Set theory Sheffer stroke Sign (mathematics) Solver Special case Stochastic process String (computer science) Subsequence Subset Theorem Thermodynamic equilibrium Trial and error Turing machine Typewriter Universal Turing machine Variable (mathematics) |
ISBN | 1-4008-8261-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Preface -- Contents -- Finite Automata -- Representation of Events in Nerve Nets and Finite Automata / Kleene, S. C. -- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components / Neumann, J. von -- Some Uneconomical Robots / Culbertson, James T. -- Some Universal Elements for Finite Automata / Minsky, M. L. -- Gedanken-Experiments on Sequential Machines / Moore, Edward F. -- Turing Machines -- A Universal Turing Machine with Two Internal States / Shannon, Claude E. -- A Note on Universal Turing Machines / Davis, M. D. -- The Inversion of Functions Defined by Turing Machines / McCarthy, John -- Computability by Probabilistic Machines / Leeuw, K. de / Moore, E. F. / Shannon, C. E. / Shapiro, N. -- Synthesis of Automata -- Design for an Intelligence-Amplifier / Ashby, W. Ross -- The Epistemological Problem for Automata / MacKay, D. M. -- Conditional Probability Machines and Conditioned Reflexes / Uttley, Albert M. -- Temporal and Spatial Patterns in a Conditional Probability Machine / Uttley, Albert M. |
Record Nr. | UNINA-9910154745703321 |
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
The Calculi of Lambda Conversion. (AM-6), Volume 6 / / Alonzo Church |
Autore | Church Alonzo |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (89 pages) |
Disciplina | 517.5 |
Collana | Annals of Mathematics Studies |
Soggetto topico |
Logic, Symbolic and mathematical
Recursive functions |
Soggetto non controllato |
2H
A-normal form Addition Alphabetical order Ambiguity Argument of a function Axiom Bibliography Big O notation Calculation Characteristic function (probability theory) Combination Complex number Computability Computation Consistency Corollary Definition Denotation Determination Differential calculus Enumeration Equation Exc Existential quantification Exponentiation Finitary Finite set Formal system Frege (programming language) Function (mathematics) Gödel numbering Identity function In the process of Integer Iteration Limit (mathematics) Logic Logical conjunction Logical disjunction Mathematical induction Mathematical logic Mathematics Metamathematics Natural number Negation Notation Null set Number theory Ordinal number Pairing Paul Bernays Primitive recursive function Principia Mathematica Propositional function Quantifier (logic) Real number Recursion (computer science) Recursion Reduction of order Requirement Resultant Rule of inference Scientific notation Sequence Set theory Special case Successor function Theorem Theory Transfinite number Transfinite Truth value Uncertainty Universal quantification Upper and lower bounds Variable (mathematics) Well-formed formula Without loss of generality |
ISBN | 1-4008-8193-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- CONTENTS -- Chapter I. INTRODUCTORY -- Chapter II. LAMBDA-CONVERSION -- Chapter III. LAMBDA-DEFINABILITY -- Chapter IV. COMBINATIONS, GÖDEL NUMBERS -- Chapter V. THE CALCULI OF λ-K-CONVERSION AND λ-δ- CONVERSION -- INDEX OP THE PRINCIPAL FORMULAS INTRODUCED BY DEFINITION -- BIBLIOGRAPHY -- CORRECTION AND ADDITIONS |
Record Nr. | UNINA-9910154753003321 |
Church Alonzo
![]() |
||
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Degrees of Unsolvability. (AM-55), Volume 55 / / Gerald E. Sacks |
Autore | Sacks Gerald E. |
Edizione | [Second edition.] |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (189 pages) |
Disciplina | 517.5 |
Collana | Annals of Mathematics Studies |
Soggetto topico |
Recursive functions
Unsolvability (Mathematical logic) |
Soggetto non controllato |
Addition
Aleph number Algebraic topology Approximation Arithmetic function Arithmetical set Axiom of choice Baire category theorem Cardinality of the continuum Cardinality Cartesian product Category theory Commutative property Conjecture Continuum hypothesis Contradiction Corollary Countable set Disjoint union Effective method Empty set Enumeration Equation Existence theorem Existential quantification Finite set Fixed-point theorem Fourier analysis Fubini's theorem Gödel numbering Identity function Inequality (mathematics) Infimum and supremum Integer Lebesgue measure Limit of a sequence Limit point Mathematical induction Mathematics Mean of a function Measure (mathematics) Metric space Monotonic function Mostowski Mutual exclusivity Natural number Null set Open set Partial function Partially ordered set Predicate (mathematical logic) Product measure Product topology Real number Recursion Recursive set Recursively enumerable set Reductio ad absurdum Regular space Requirement Scientific notation Sequence Set (mathematics) Simultaneous equations Subset Theorem Topology Transfinite induction Tychonoff's theorem Uncountable set Union (set theory) Upper and lower bounds Variable (mathematics) W0 Well-order Without loss of generality Zorn's lemma |
ISBN | 1-4008-8184-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Preface to revised edition -- Contents -- §1. Preliminaries -- §2 . A Continuum of Mutually Incomparable Degrees -- §3. Uncountable Suborderings of Degrees -- §4. The Priority Method Of Friedberg and Muchnik -- §5. An Existence Theorem For Recursively Enumerable Degrees -- §6 . The Jump Operator -- §7. An Interpolation Theorem for Recursively Enumerable Degrees -- §8. Minimal Upper Bounds for Sequences of Degrees -- §9. Minimal Degrees -- §10. Measure-Theoretic, Category and Descriptive Set-Theoretic Arguments -- §11. Initial Segments of Degrees -- §12. Further Results and Conjectures -- Bibliography |
Record Nr. | UNINA-9910154752603321 |
Sacks Gerald E.
![]() |
||
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Introduction to Mathematical Logic (PMS-13), Volume 13 / / Alonzo Church |
Autore | Church Alonzo |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (389 pages) |
Disciplina | 511.3 |
Collana | Princeton Mathematical Series |
Soggetto topico | Logic, Symbolic and mathematical |
Soggetto non controllato |
Abstract algebra
Acta Mathematica Arithmetic Axiom of choice Axiom of infinity Axiom of reducibility Axiom schema Axiom Axiomatic system Binary function Boolean algebra (structure) Boolean ring Calculus ratiocinator Characterization (mathematics) Class (set theory) Classical mathematics Commutative property Commutative ring Conditional disjunction David Hilbert Decision problem Deduction theorem Denotation Disjunctive syllogism Double negation Duality (mathematics) Elementary algebra Elementary arithmetic English alphabet Equation Existential quantification Expression (mathematics) Formation rule Frege (programming language) Function (mathematics) Functional calculus Fundamenta Mathematicae Gödel numbering Gödel's completeness theorem Gödel's incompleteness theorems Hilbert's program Hypothetical syllogism Imperative logic Inference Introduction to Mathematical Philosophy Lambda calculus Linear differential equation Logic Logical connective Logical disjunction Material implication (rule of inference) Mathematical analysis Mathematical induction Mathematical logic Mathematical notation Mathematical practice Mathematical problem Mathematical theory Mathematics Mathematische Zeitschrift Metatheorem Modal logic Modus ponendo tollens Natural number Naturalness (physics) Negation Notation Number theory Object language Parity (mathematics) Predicate (mathematical logic) Prenex normal form Principia Mathematica Propositional calculus Propositional function Propositional variable Quantifier (logic) Range (mathematics) Real number Recursion (computer science) Restriction (mathematics) Riemann surface Ring (mathematics) Rule of inference Scientific notation Second-order arithmetic Series (mathematics) Sign (mathematics) Skolem normal form Special case Tautology (logic) Term logic The Principles of Mathematics Theorem Three-dimensional space (mathematics) Transfinite number Triviality (mathematics) Truth table Variable (mathematics) Zermelo set theory |
ISBN | 1-4008-8145-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Preface -- Contents -- Introduction -- I. The Propositional Calculus -- II. The Propositional Calculus (Continued) -- III. Functional Calculi of First Order -- IV. The Pure Functional Calculus of First Order -- V. Functional Calculi of Second Order -- Index of Definitions -- Index of Authors -- Errata |
Record Nr. | UNINA-9910154754303321 |
Church Alonzo
![]() |
||
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
On Group-Theoretic Decision Problems and Their Classification. (AM-68), Volume 68 / / Charles F. Miller |
Autore | Miller Charles F. |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (121 pages) |
Disciplina | 512/.2 |
Collana | Annals of Mathematics Studies |
Soggetto topico |
Group theory
Logic, Symbolic and mathematical |
Soggetto non controllato |
Abelian group
Betti number Characteristic function (probability theory) Characterization (mathematics) Combinatorial group theory Conjecture Conjugacy class Conjugacy problem Contradiction Corollary Cyclic permutation Decision problem Diffeomorphism Direct product Direct proof Effective method Elementary class Embedding Enumeration Epimorphism Equation Equivalence relation Exact sequence Existential quantification Finite group Finite set Finitely generated group Finitely presented Free group Free product Fundamental group Fundamental theorem Group (mathematics) Group theory Gödel numbering Homomorphism Homotopy Inner automorphism Markov property Mathematical logic Mathematical proof Mathematics Monograph Natural number Nilpotent group Normal subgroup Notation Permutation Polycyclic group Presentation of a group Quotient group Recursive set Requirement Residually finite group Semigroup Simple set Simplicial complex Solvable group Statistical hypothesis testing Subgroup Theorem Theory Topology Transitive relation Triviality (mathematics) Truth table Turing degree Turing machine Without loss of generality Word problem (mathematics) |
ISBN | 1-4008-8178-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- PREFACE -- CONTENTS -- CHAPTER I. INTRODUCTION -- CHAPTER II. PROPERTIES OF BRITTON EXTENSIONS -- CHAPTER III. UNSOLVABILITY RESULTS FOR RESIDUALLY FINITE GROUPS -- CHAPTER IV. THE WORD AND CONJUGACY PROBLEMS FOR CERTAIN ELEMENTARY GROUPS -- CHAPTER V. ON THE ISOMORPHISM PROBLEM FOR GROUPS -- LIST OF REFERENCES -- INDEX OF SYMBOLS -- INDEX |
Record Nr. | UNINA-9910154751403321 |
Miller Charles F.
![]() |
||
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Theory of Formal Systems. (AM-47), Volume 47 / / Raymond M. Smullyan |
Autore | Smullyan Raymond M. |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (157 pages) : illustrations |
Disciplina | 511.33 |
Collana | Annals of Mathematics Studies |
Soggetto topico |
Recursive functions
Metamathematics |
Soggetto non controllato |
Addition
Algebraic geometry Alonzo Church Arithmetic function Arithmetic Atomic sentence Axiom A. Axiom schema Axiom Axiomatic system Binary relation Cantor's diagonal argument Cartesian product Characterization (mathematics) Chinese remainder theorem Closed-form expression Closure (mathematics) Combination Combinatory logic Complement (set theory) Concatenation theory Consistency Constructive proof Corollary Countable set Counterexample Decidability (logic) Decision problem Definable set Diagonalization Direct proof Disjoint sets Enumeration Equation Existential quantification Exponential function Finite set Formal system Functional calculus Gödel numbering Gödel's incompleteness theorems Herbrand's theorem Inference Integer factorization Iteration John Myhill Logical connective Logical consequence Mathematical induction Mathematical logic Mathematician Mathematics Metamathematics Modus ponens Natural number Negation Number theory Order theory Parity (mathematics) Peano axioms Predicate (mathematical logic) Prenex normal form Primitive recursive function Quantifier (logic) Recursion Recursive set Recursively enumerable set Remainder Requirement Rule of inference Scientific notation Sequence Set (mathematics) Sign (mathematics) Special case Subset Suggestion System U. Theorem Theory Transfinite number Turing machine Universal set Validity Variable (mathematics) Zermelo set theory |
ISBN | 1-4008-8200-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- TABLE OF CONTENTS -- PREFACE -- ANNALS OF MATHEMATICS STUDIES -- CHAPTER I: FORMAL MATHEMATICAL SYSTEMS -- CHAPTER II: FORMAL REPRESENTABILITY AND RECURSIVE ENUMERABILITY -- CHAPTER III: INCOMPLETENESS -AND UNDECIDABILITY -- CHAPTER IV: RECURSIVE FUNCTION THEORY -- CHAPTER V: CREATIVITY AND EFFECTIVE INSEPARABILITY -- SUPPLEMENT: APPLICATIONS TO MATHEMATICAL LOGIC -- REFERENCE AND BRIEF BIBLIOGRAPHY |
Record Nr. | UNINA-9910154750903321 |
Smullyan Raymond M.
![]() |
||
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|