Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
COLOG-88 [[electronic resource] ] : International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, Proceedings / / edited by Per Martin-Löf, Grigori Mints
| COLOG-88 [[electronic resource] ] : International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, Proceedings / / edited by Per Martin-Löf, Grigori Mints |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (VI, 339 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Philosophy and science Artificial intelligence Computer programming Theory of Computation Mathematical Logic and Foundations Philosophy of Science Mathematical Logic and Formal Languages Artificial Intelligence Programming Techniques |
| ISBN | 3-540-46963-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic specified processes and enumerable models -- On conditions of full coherence in biclosed categories: A new application of proof theory -- The use of justification systems for integrated semantics -- An equational deductive system for the differential and integral calculus -- Inductively defined types -- Algorithms for probabilistic inference -- Geometry of interaction 2: Deadlock-free algorithms -- On the syntax of infinite objects: an extension of Martin-Löf's theory of expressions -- ?-Reductions and ?-developments of ?-terms with the least number of steps -- Group-theoretic approach to intractable problems -- On some applications of Heyting-valued analysis II -- Mathematics of infinity -- Gentzen-type systems and resolution rules part I propositional logic -- On the problem of reducing search in logic program execution -- Correctness of short proofs in theory with notions of feasibility -- A formulation of the simple theory of types (for Isabelle) -- On connections between classical and constructive semantics -- Flow-diagrams with sets -- The resolution program, able to decide some solvable classes -- A structural completeness theorem for a class of conditional rewrite rule systems -- A proof-search method for the first order logic. |
| Record Nr. | UNISA-996465600603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Colorado Mathematical Olympiad: The Third Decade and Further Explorations : From the Mountains of Colorado to the Peaks of Mathematics / / by Alexander Soifer
| The Colorado Mathematical Olympiad: The Third Decade and Further Explorations : From the Mountains of Colorado to the Peaks of Mathematics / / by Alexander Soifer |
| Autore | Soifer Alexander |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (LII, 259 p. 126 illus., 47 illus. in color.) |
| Disciplina | 512.7 |
| Soggetto topico |
Number theory
Algebra Mathematical logic Geometry Number Theory Mathematical Logic and Foundations |
| ISBN | 3-319-52861-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Twenty-First Colorado Mathematical Olympiad: April 16, 2004 -- Twenty-Second Colorado Mathematical Olympiad: April 22, 2005 .-Twenty-Third Colorado Mathematical Olympiad: April 21, 2006 -- Twenty-Fourth Colorado Mathematical Olympiad: April 20, 2007 -- Twenty-Fifth Colorado Mathematical Olympiad: April 18, 2008 .-Twenty-Sixth Colorado Mathematical Olympiad: April 17, 2009 .-Twenty-Seventh Colorado Mathematical Olympiad: April 23, 2010 -- Twenty-Eighth Colorado Mathematical Olympiad: April 22, 2011 -- Twenty-Ninth Colorado Mathematical Olympiad: April 20, 2012 -- Thirtieth Colorado Mathematical Olympiad: April 26, 2013 -- A Round Table Discussion of the Olympiad,or Looking Back from a 30-Year Perspective -- E21. Cover-Up with John Conway, Mitya Karabash, and Ron Graham -- E22. Deep Roots of Uniqueness -- E23. More about Love and Death -- E24. One Amazing Problem and its Connections to Everything: A Conversation in Three Movements -- E25. The Story of One Erdős Problem -- E26. Mark Heim’s Proof -- E27. Coloring Integers – Entertainment of Mathematical Kind -E28. The Erdős Number and Hamiltonian Mysteries -- E29. One Old Erdős–Turán Problem -- E30. Birth of a Problem: The Story of Creation in Seven Stages -- Movement 1. The Colorado Mathematical Olympiad is mathematics; it is sport; it is art. And it is also community, by Matthew Kahle -- Movement 2. I've begun paying off my debt with new kids, by Aaron Parsons -- Movement 3. Aesthetic of Personal Mastery, by Hannah Alpert -- Movement 4. Colorado Mathematical Olympiad: Reminiscences by Robert Ewell. . |
| Record Nr. | UNINA-9910254309903321 |
Soifer Alexander
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algebra: Syntax and Semantics / / by Mark V. Sapir
| Combinatorial Algebra: Syntax and Semantics / / by Mark V. Sapir |
| Autore | Sapir Mark V |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 355 p. 66 illus.) |
| Disciplina | 511.6 |
| Collana | Springer Monographs in Mathematics |
| Soggetto topico |
Group theory
Combinatorics Mathematical logic Group Theory and Generalizations Mathematical Logic and Foundations |
| ISBN | 3-319-08031-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- 1. Main definitions and basic fact -- 2. Words that can be avoided -- 3. Semigroups -- 4. Rings -- 5. Groups -- Bibliography -- Index. |
| Record Nr. | UNINA-9910299980803321 |
|
Sapir Mark V
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Set Theory : With a Gentle Introduction to Forcing / / by Lorenz J. Halbeisen
| Combinatorial Set Theory : With a Gentle Introduction to Forcing / / by Lorenz J. Halbeisen |
| Autore | Halbeisen Lorenz J |
| Edizione | [2nd ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 594 p. 20 illus.) |
| Disciplina | 511.322 |
| Collana | Springer Monographs in Mathematics |
| Soggetto topico |
Mathematical logic
Combinatorics Mathematical Logic and Foundations |
| ISBN | 3-319-60231-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Setting -- First-Order Logic in a Nutshell -- Axioms of Set Theory -- Overture: Ramsey's Theorem -- Cardinal Relations in ZF Only -- Forms of Choice -- How to Make Two Balls from One -- Models of Set Theory with Atoms -- Thirteen Cardinals and Their Relations -- The Shattering Number Revisited -- Happy Families and Their Relatives -- Coda: A Dual Form of Ramsey’s Theorem -- The Idea of Forcing -- Martin's Axiom -- The Notion of Forcing -- Proving Unprovability -- Models in Which AC Fails -- Combining Forcing Notions -- Models in Which p=c -- Suslin’s Problem -- Properties of Forcing Extensions -- Cohen Forcing Revisited -- Sacks Forcing -- Silver-Like Forcing Notions -- Miller Forcing -- Mathias Forcing -- How Many Ramsey Ultrafilters Exist? -- Combinatorial Properties of Sets of Partitions -- Suite. |
| Record Nr. | UNINA-9910254296403321 |
|
Halbeisen Lorenz J
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Set Theory of C-algebras / / by Ilijas Farah
| Combinatorial Set Theory of C-algebras / / by Ilijas Farah |
| Autore | Farah Ilijas |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (535 pages) |
| Disciplina | 512.55 |
| Collana | Springer Monographs in Mathematics |
| Soggetto topico |
Mathematical logic
Functional analysis Operator theory Associative rings Rings (Algebra) Mathematical Logic and Foundations Functional Analysis Operator Theory Associative Rings and Algebras |
| ISBN | 3-030-27093-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. C*-algebras, Abstract and Concrete -- 2. Examples and Constructions of C*-algebras -- 3. Representations of C*-algebras -- 4. Tracial States and Representations of C*-algebras -- 5. Irreducible Representations of C*-algebras -- Part II Set Theory and Nonseparable C*-algebras -- 6. Infinitary Combinatorics, I -- 7. Infinitary Combinatorics, II: The Metric Case -- 8. Additional Set-Theoretic Axioms -- 9. Set Theory and Quotients -- 10. Constructions of Nonseparable C*-algebras, I: Graph CCR Algebras -- 11. Constructions of Nonseparable C*-algebras, II -- Part III Massive Quotient C*-algebras -- 12. The Calkin Algebra -- 13. Multiplier Algebras and Coronas -- 14. Gaps and Incompactness -- 15. Degree-1 Saturation -- 16. Full Saturation -- 17. Automorphisms of Massive Quotient C*-Algebras.-Part IV Appendices -- A. Axiomatic Set Theory -- B. Descriptive Set Theory -- C. Functional Analysis -- D. Model Theory -- References -- Index -- List of Symbols. |
| Record Nr. | UNINA-9910364957303321 |
|
Farah Ilijas
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Complexity and Real Computation [[electronic resource] /] / by Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale
| Complexity and Real Computation [[electronic resource] /] / by Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale |
| Autore | Blum Lenore |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XVI, 453 p.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computer science
Computers Mathematical logic Computer Science Theory of Computation Mathematical Logic and Foundations |
| ISBN | 1-4612-0701-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Introduction -- 2 Definitions and First Properties of Computation -- 3 Computation over a Ring -- 4 Decision Problems and Complexity over a Ring -- 5 The Class NP and NP-Complete Problems -- 6 Integer Machines -- 7 Algebraic Settings for the Problem “P ? NP?” -- 8 Newton’s Method -- 9 Fundamental Theorem of Algebra: Complexity Aspects -- 10 Bézout’s Theorem -- 11 Condition Numbers and the Loss of Precision of Linear Equations -- 12 The Condition Number for Nonlinear Problems -- 13 The Condition Number in ?(H(d) -- 14 Complexity and the Condition Number -- 15 Linear Programming -- 16 Deterministic Lower Bounds -- 17 Probabilistic Machines -- 18 Parallel Computations -- 19 Some Separations of Complexity Classes -- 20 Weak Machines -- 21 Additive Machines -- 22 Nonuniform Complexity Classes -- 23 Descriptive Complexity -- References. |
| Record Nr. | UNINA-9910478928003321 |
|
Blum Lenore
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Complexity and Real Computation [[electronic resource] /] / by Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale
| Complexity and Real Computation [[electronic resource] /] / by Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale |
| Autore | Blum Lenore |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XVI, 453 p.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computer science
Computers Mathematical logic Computer Science Theory of Computation Mathematical Logic and Foundations |
| ISBN | 1-4612-0701-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Introduction -- 2 Definitions and First Properties of Computation -- 3 Computation over a Ring -- 4 Decision Problems and Complexity over a Ring -- 5 The Class NP and NP-Complete Problems -- 6 Integer Machines -- 7 Algebraic Settings for the Problem “P ? NP?” -- 8 Newton’s Method -- 9 Fundamental Theorem of Algebra: Complexity Aspects -- 10 Bézout’s Theorem -- 11 Condition Numbers and the Loss of Precision of Linear Equations -- 12 The Condition Number for Nonlinear Problems -- 13 The Condition Number in ?(H(d) -- 14 Complexity and the Condition Number -- 15 Linear Programming -- 16 Deterministic Lower Bounds -- 17 Probabilistic Machines -- 18 Parallel Computations -- 19 Some Separations of Complexity Classes -- 20 Weak Machines -- 21 Additive Machines -- 22 Nonuniform Complexity Classes -- 23 Descriptive Complexity -- References. |
| Record Nr. | UNINA-9910789345503321 |
|
Blum Lenore
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Complexity and Real Computation / / by Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale
| Complexity and Real Computation / / by Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale |
| Autore | Blum Lenore |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XVI, 453 p.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computer science
Computers Mathematical logic Computer Science Theory of Computation Mathematical Logic and Foundations |
| ISBN | 1-4612-0701-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Introduction -- 2 Definitions and First Properties of Computation -- 3 Computation over a Ring -- 4 Decision Problems and Complexity over a Ring -- 5 The Class NP and NP-Complete Problems -- 6 Integer Machines -- 7 Algebraic Settings for the Problem “P ? NP?” -- 8 Newton’s Method -- 9 Fundamental Theorem of Algebra: Complexity Aspects -- 10 Bézout’s Theorem -- 11 Condition Numbers and the Loss of Precision of Linear Equations -- 12 The Condition Number for Nonlinear Problems -- 13 The Condition Number in ?(H(d) -- 14 Complexity and the Condition Number -- 15 Linear Programming -- 16 Deterministic Lower Bounds -- 17 Probabilistic Machines -- 18 Parallel Computations -- 19 Some Separations of Complexity Classes -- 20 Weak Machines -- 21 Additive Machines -- 22 Nonuniform Complexity Classes -- 23 Descriptive Complexity -- References. |
| Record Nr. | UNINA-9910828777203321 |
|
Blum Lenore
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability and Complexity in Analysis [[electronic resource] ] : 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers / / edited by Jens Blanck, Vasco Brattka, Peter Hertling
| Computability and Complexity in Analysis [[electronic resource] ] : 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers / / edited by Jens Blanck, Vasco Brattka, Peter Hertling |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 396 p.) |
| Disciplina | 515 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Database management Computer programming Algorithms Mathematical logic Computation by Abstract Devices Database Management Programming Techniques Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
| ISBN | 3-540-45335-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computability and Complexity in Analysis -- Effectivity of Regular Spaces -- The Degree of Unsolvability of a Real Number -- A Survey of Exact Arithmetic Implementations -- Standard Representations of Effective Metric Spaces -- Banach-Mazur Computable Functions on Metric Spaces -- A Generic Root Operation for Exact Real Arithmetic -- Effective Contraction Theorem and Its Application -- Polynomially Time Computable Functions over p-Adic Fields -- On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems -- Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory -- Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations -- ?-Approximable Functions -- Computabilities of Fine-Continuous Functions -- The iRRAM: Exact Arithmetic in C++ -- The Uniformity Conjecture -- Admissible Representations of Limit Spaces -- Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions -- Effective Fixed Point Theorem over a Non-Computably Separable Metric Space -- Computational Dimension of Topological Spaces -- Some Properties of the Effective Uniform Topological Space -- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable -- Is the Linear Schrödinger Propagator Turing Computable? -- A Computable Spectral Theorem -- Report on Competition -- Exact Real Arithmetic Systems: Results of Competition. |
| Record Nr. | UNISA-996465905303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computability and Complexity in Analysis : 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers / / edited by Jens Blanck, Vasco Brattka, Peter Hertling
| Computability and Complexity in Analysis : 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers / / edited by Jens Blanck, Vasco Brattka, Peter Hertling |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 396 p.) |
| Disciplina | 515 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Database management Computer programming Algorithms Mathematical logic Computation by Abstract Devices Database Management Programming Techniques Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
| ISBN | 3-540-45335-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computability and Complexity in Analysis -- Effectivity of Regular Spaces -- The Degree of Unsolvability of a Real Number -- A Survey of Exact Arithmetic Implementations -- Standard Representations of Effective Metric Spaces -- Banach-Mazur Computable Functions on Metric Spaces -- A Generic Root Operation for Exact Real Arithmetic -- Effective Contraction Theorem and Its Application -- Polynomially Time Computable Functions over p-Adic Fields -- On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems -- Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory -- Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations -- ?-Approximable Functions -- Computabilities of Fine-Continuous Functions -- The iRRAM: Exact Arithmetic in C++ -- The Uniformity Conjecture -- Admissible Representations of Limit Spaces -- Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions -- Effective Fixed Point Theorem over a Non-Computably Separable Metric Space -- Computational Dimension of Topological Spaces -- Some Properties of the Effective Uniform Topological Space -- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable -- Is the Linear Schrödinger Propagator Turing Computable? -- A Computable Spectral Theorem -- Report on Competition -- Exact Real Arithmetic Systems: Results of Competition. |
| Record Nr. | UNINA-9910143602303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
