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.
Mathesis Universalis, Computability and Proof / / edited by Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster
| Mathesis Universalis, Computability and Proof / / edited by Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (375 pages) |
| Disciplina | 511.3 |
| Collana | Synthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science |
| Soggetto topico |
Logic
Mathematical logic Mathematical Logic and Foundations Mathematical Logic and Formal Languages |
| ISBN | 3-030-20447-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction: Mathesis Universalis, Proof and Computation (Stefania Centrone) -- 2. Diplomacy of Trust in the European Crisis (Enno Aufderheide) -- 3. Mathesis Universalis and Homotopy Type Theory (Steve Awodey) -- 4. Note on the Benefit of Proof Representations by Name (Matthias Baaz) -- 5. Constructive Proofs of Negated Statements (Josef Berger and Gregor Svindland) -- 6. Constructivism in Abstract Mathematics (Ulrich Berger) -- 7. Addressing Circular Definitions via Systems of Proofs (Riccardo Bruni) -- 8. The Monotone Completeness Theorem in Constructive Reverse Mathematics (Hajime Ishihara and Takako Nemoto) -- 9. From Mathesis Universalis to Fixed Points and Related Set-Theoretic Concepts (Gerhard Jäger and Silvia Steila) -- 10. Through an Inference Rule, Darkly (Roman Kuznets) -- 11. Objectivity and Truth in Mathematics: A Sober Non-Platonist Perspective (Godehard Link) -- 12. From Mathesis Universalis to Provability, Computability, and Constructivity (Klaus Mainzer) -- 13. Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus: a Survey (Pierluigi Minari) -- 14. Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Thomas Powell) -- 15. The Concepts of Proof and Ground (Dag Prawitz) -- 16. On Relating Theories: Proof-Theoretical Reduction (Michael Rathjen and Michael Toppel) -- 17. Program Extraction from Proofs: the Fan Theorem for Uniformly Coconvex Bars (Helmut Schwichtenberg) -- 18. Counting and Numbers, from Pure Mathesis to Base Conversion Algorithms (Jan von Plato) -- 19. Point-Free Spectra of Linear Spreads (Daniel Wessel). . |
| Record Nr. | UNINA-9910349539003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Well-Quasi Orders in Computation, Logic, Language and Reasoning [[electronic resource] ] : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory / / edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann
| Well-Quasi Orders in Computation, Logic, Language and Reasoning [[electronic resource] ] : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory / / edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 391 p. 103 illus., 4 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Trends in Logic, Studia Logica Library |
| Soggetto topico |
Logic
Graph theory Mathematical logic Combinatorics Logic design Graph Theory Mathematical Logic and Formal Languages Logic Design |
| ISBN | 3-030-30229-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Well, Better, and in-between -- The Categorical Structure of Well-Quasi Orders -- On Kriz's Theorem -- On the Width of FAC Orders, a Somewhat Rediscovered Notion -- Preliminary Well-quasi Orders in the Study of Hierarchies and Reducibilities -- The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings -- Well-Quasi Orders and Regularity -- Well Quasi Ordering and Embeddability of Relational Structures -- A Functional Interpretation of Zorn's Lemma and its Application in Well-Quasi-Order Theory -- The Reverse Mathematics of wqos and bqos -- Well-partial Ordering and the Maximal Order Type -- TBC -- The Worlds of Well-Partial-Orders and Ordinal Notation systems -- Bounds for the Strength of the Graph Minor Theorem. |
| Record Nr. | UNISA-996418203403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Well-Quasi Orders in Computation, Logic, Language and Reasoning : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory / / edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann
| Well-Quasi Orders in Computation, Logic, Language and Reasoning : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory / / edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 391 p. 103 illus., 4 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Trends in Logic, Studia Logica Library |
| Soggetto topico |
Logic
Graph theory Mathematical logic Combinatorics Logic design Graph Theory Mathematical Logic and Formal Languages Logic Design |
| ISBN | 3-030-30229-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Well, Better, and in-between -- The Categorical Structure of Well-Quasi Orders -- On Kriz's Theorem -- On the Width of FAC Orders, a Somewhat Rediscovered Notion -- Preliminary Well-quasi Orders in the Study of Hierarchies and Reducibilities -- The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings -- Well-Quasi Orders and Regularity -- Well Quasi Ordering and Embeddability of Relational Structures -- A Functional Interpretation of Zorn's Lemma and its Application in Well-Quasi-Order Theory -- The Reverse Mathematics of wqos and bqos -- Well-partial Ordering and the Maximal Order Type -- TBC -- The Worlds of Well-Partial-Orders and Ordinal Notation systems -- Bounds for the Strength of the Graph Minor Theorem. |
| Record Nr. | UNINA-9910482968603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||