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.
Efektivnost v systému zpetných toku / / Alena Klapalová, Michal Krcál, Radoslav Skapa
| Efektivnost v systému zpetných toku / / Alena Klapalová, Michal Krcál, Radoslav Skapa |
| Autore | Klapalová Alena |
| Pubbl/distr/stampa | Brno, [Czech Republic] : , : Masarykova univerzita : , : Ekonomicko-správní fakulta, , 2013 |
| Descrizione fisica | 1 online resource (81 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Reverse mathematics |
| Soggetto genere / forma | Electronic books. |
| ISBN | 80-210-6707-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | cze |
| Record Nr. | UNINA-9910465248703321 |
Klapalová Alena
|
||
| Brno, [Czech Republic] : , : Masarykova univerzita : , : Ekonomicko-správní fakulta, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Efektivnost v systému zpetných toku / / Alena Klapalová, Michal Krcál, Radoslav Skapa
| Efektivnost v systému zpetných toku / / Alena Klapalová, Michal Krcál, Radoslav Skapa |
| Autore | Klapalová Alena |
| Pubbl/distr/stampa | Brno, [Czech Republic] : , : Masarykova univerzita : , : Ekonomicko-správní fakulta, , 2013 |
| Descrizione fisica | 1 online resource (81 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Reverse mathematics |
| ISBN | 80-210-6707-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | cze |
| Record Nr. | UNINA-9910798310503321 |
|
Klapalová Alena
|
||
| Brno, [Czech Republic] : , : Masarykova univerzita : , : Ekonomicko-správní fakulta, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Efektivnost v systému zpetných toku / / Alena Klapalová, Michal Krcál, Radoslav Skapa
| Efektivnost v systému zpetných toku / / Alena Klapalová, Michal Krcál, Radoslav Skapa |
| Autore | Klapalová Alena |
| Pubbl/distr/stampa | Brno, [Czech Republic] : , : Masarykova univerzita : , : Ekonomicko-správní fakulta, , 2013 |
| Descrizione fisica | 1 online resource (81 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Reverse mathematics |
| ISBN | 80-210-6707-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | cze |
| Record Nr. | UNINA-9910824388103321 |
|
Klapalová Alena
|
||
| Brno, [Czech Republic] : , : Masarykova univerzita : , : Ekonomicko-správní fakulta, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore
| Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore |
| Autore | Hirschfeldt Denis Roman |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 2017 |
| Descrizione fisica | 1 online resource (107 pages) |
| Disciplina | 511.3 |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Reverse mathematics
Computable functions Decidability (Mathematical logic) |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-4704-4141-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910479859003321 |
|
Hirschfeldt Denis Roman
|
||
| Providence, Rhode Island : , : American Mathematical Society, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore
| Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore |
| Autore | Hirschfeldt Denis Roman |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 2017 |
| Descrizione fisica | 1 online resource (107 pages) |
| Disciplina | 511.3 |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Reverse mathematics
Computable functions Decidability (Mathematical logic) |
| ISBN | 1-4704-4141-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910796234703321 |
|
Hirschfeldt Denis Roman
|
||
| Providence, Rhode Island : , : American Mathematical Society, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore
| Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore |
| Autore | Hirschfeldt Denis Roman |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 2017 |
| Descrizione fisica | 1 online resource (107 pages) |
| Disciplina | 511.3 |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Reverse mathematics
Computable functions Decidability (Mathematical logic) |
| ISBN | 1-4704-4141-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910821971703321 |
|
Hirschfeldt Denis Roman
|
||
| Providence, Rhode Island : , : American Mathematical Society, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Reverse mathematics : problems, reductions, and proofs / / Damir D. Dzhafarov, Carl Mummert
| Reverse mathematics : problems, reductions, and proofs / / Damir D. Dzhafarov, Carl Mummert |
| Autore | Dzhafarov Damir D. |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (498 pages) |
| Disciplina | 511.3 |
| Collana | Theory and applications of computability |
| Soggetto topico |
Computable functions
Reverse mathematics |
| ISBN | 3-031-11367-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Acknowledgments -- Contents -- List of Figures -- Introduction -- What is reverse mathematics? -- Historical remarks -- Considerations about coding -- Philosophical implications -- Conventions and notation -- Part I Computable mathematics -- Computability theory -- The informal idea of computability -- Primitive recursive functions -- Some primitive recursive functions -- Bounded quantification -- Coding sequences with primitive recursion -- Turing computability -- Three key theorems -- Computably enumerable sets and the halting problem -- The arithmetical hierarchy and Post's theorem -- Relativization and oracles -- Trees and PA degrees -- Pi-0-1 classes -- Basis theorems -- PA degrees -- Exercises -- Instance-solution problems -- Problems -- Forall/exists theorems -- Multiple problem forms -- Represented spaces -- Representing R -- Complexity -- Uniformity -- Further examples -- Exercises -- Problem reducibilities -- Subproblems and identity reducibility -- Computable reducibility -- Weihrauch reducibility -- Strong forms -- Multiple applications -- Omega model reducibility -- Hirschfeldt-Jockusch games -- Exercises -- Part II Formalization and syntax -- Second order arithmetic -- Syntax and semantics -- Hierarchies of formulas -- Arithmetical formulas -- Analytical formulas -- Arithmetic -- First order arithmetic -- Second order arithmetic -- Formalization -- The subsystem RCAo -- Delta-0-1 comprehension -- Coding finite sets -- Formalizing computability theory -- The subsystems ACAo and WKLo -- The subsystem ACA0 -- The subsystem WKL0 -- Equivalences between mathematical principles -- The subsystems P11-CAo and ATRo -- The subsystem Pi-1-1-CA0 -- The subsystem ATR0 -- Conservation results -- First order parts of theories -- Comparing reducibility notions -- Full second order semantics -- Exercises -- Induction and bounding.
Induction, bounding, and least number principles -- Finiteness, cuts, and all that -- The Kirby-Paris hierarchy -- Reverse recursion theory -- Hirst's theorem and B-Sigma02 -- So, why Sigma-01 induction? -- Exercises -- Forcing -- A motivating example -- Notions of forcing -- Density and genericity -- The forcing relation -- Effective forcing -- Forcing in models -- Harrington's theorem and conservation -- Exercises -- Part III Combinatorics -- Ramsey's theorem -- Upper bounds -- Lower bounds -- Seetapun's theorem -- Stability and cohesiveness -- Stability -- Cohesiveness -- The Cholak-Jockusch-Slaman decomposition -- A different proof of Seetapun's theorem -- Other applications -- Liu's theorem -- Preliminaries -- Proof of Lemma 8.6.6 -- Proof of Lemma 8.6.7 -- The first order part of RT -- Two versus arbitrarily many colors -- Proof of Proposition 8.7.4 -- Proof of Proposition 8.7.5 -- What else is known? -- The SRT22 vs. COH problem -- Summary: Ramsey's theorem and the ``big five'' -- Exercises -- Other combinatorial principles -- Finer results about RT -- Ramsey's theorem for singletons -- Ramsey's theorem for higher exponents -- Homogeneity vs. limit homogeneity -- Partial and linear orders -- Equivalences and bounds -- Stable partial and linear orders -- Separations over RCA0 -- Variants under finer reducibilities -- Polarized Ramsey's theorem -- Rainbow Ramsey's theorem -- Erdős-Moser theorem -- The Chubb-Hirst-McNicholl tree theorem -- Milliken's tree theorem -- Thin set and free set theorems -- Hindman's theorem -- Apartness, gaps, and finite unions -- Towsner's simple proof -- Variants with bounded sums -- Applications of the Lovász local lemma -- Model theoretic and set theoretic principles -- Languages, theories, and models -- The atomic model theorem -- The finite intersection principle -- Weak weak König's lemma. The reverse mathematics zoo -- Exercises -- Part IV Other areas -- Analysis and topology -- Formalizations of the real line -- Sequences and convergence -- Sets and continuous functions -- Sets of points -- Continuous functions -- The intermediate value theorem -- Closed sets and compactness -- Separably closed sets -- Uniform continuity and boundedness -- Topological dynamics and ergodic theory -- Birkhoff's recurrence theorem -- The Auslander-Ellis theorem and iterated Hindman's theorem -- Measure theory and the mean ergodic theorem -- Additional results in real analysis -- Topology, MF spaces, CSC spaces -- Countable, second countable spaces -- MF spaces -- Reverse mathematics of MF spaces -- Exercises -- Algebra -- Groups, rings, and other structures -- Vector spaces and bases -- The complexity of ideals -- Orderability -- The Nielsen-Schreier theorem -- Other topics -- Exercises -- Set theory and beyond -- Well orderings and ordinals -- The Sigma-1-1 separation principle -- Comparability of well orderings -- Proof of Proposition 12.1.12 -- Descriptive set theory -- Determinacy -- Gale-Stewart games -- Clopen and open determinacy -- Gödel's constructible universe -- Friedman's theorem -- Higher order reverse mathematics -- Exercises -- References -- Index. |
| Record Nr. | UNISA-996483160303316 |
|
Dzhafarov Damir D.
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Reverse mathematics : problems, reductions, and proofs / / Damir D. Dzhafarov, Carl Mummert
| Reverse mathematics : problems, reductions, and proofs / / Damir D. Dzhafarov, Carl Mummert |
| Autore | Dzhafarov Damir D. |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (498 pages) |
| Disciplina | 511.3 |
| Collana | Theory and applications of computability |
| Soggetto topico |
Computable functions
Reverse mathematics |
| ISBN | 3-031-11367-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Acknowledgments -- Contents -- List of Figures -- Introduction -- What is reverse mathematics? -- Historical remarks -- Considerations about coding -- Philosophical implications -- Conventions and notation -- Part I Computable mathematics -- Computability theory -- The informal idea of computability -- Primitive recursive functions -- Some primitive recursive functions -- Bounded quantification -- Coding sequences with primitive recursion -- Turing computability -- Three key theorems -- Computably enumerable sets and the halting problem -- The arithmetical hierarchy and Post's theorem -- Relativization and oracles -- Trees and PA degrees -- Pi-0-1 classes -- Basis theorems -- PA degrees -- Exercises -- Instance-solution problems -- Problems -- Forall/exists theorems -- Multiple problem forms -- Represented spaces -- Representing R -- Complexity -- Uniformity -- Further examples -- Exercises -- Problem reducibilities -- Subproblems and identity reducibility -- Computable reducibility -- Weihrauch reducibility -- Strong forms -- Multiple applications -- Omega model reducibility -- Hirschfeldt-Jockusch games -- Exercises -- Part II Formalization and syntax -- Second order arithmetic -- Syntax and semantics -- Hierarchies of formulas -- Arithmetical formulas -- Analytical formulas -- Arithmetic -- First order arithmetic -- Second order arithmetic -- Formalization -- The subsystem RCAo -- Delta-0-1 comprehension -- Coding finite sets -- Formalizing computability theory -- The subsystems ACAo and WKLo -- The subsystem ACA0 -- The subsystem WKL0 -- Equivalences between mathematical principles -- The subsystems P11-CAo and ATRo -- The subsystem Pi-1-1-CA0 -- The subsystem ATR0 -- Conservation results -- First order parts of theories -- Comparing reducibility notions -- Full second order semantics -- Exercises -- Induction and bounding.
Induction, bounding, and least number principles -- Finiteness, cuts, and all that -- The Kirby-Paris hierarchy -- Reverse recursion theory -- Hirst's theorem and B-Sigma02 -- So, why Sigma-01 induction? -- Exercises -- Forcing -- A motivating example -- Notions of forcing -- Density and genericity -- The forcing relation -- Effective forcing -- Forcing in models -- Harrington's theorem and conservation -- Exercises -- Part III Combinatorics -- Ramsey's theorem -- Upper bounds -- Lower bounds -- Seetapun's theorem -- Stability and cohesiveness -- Stability -- Cohesiveness -- The Cholak-Jockusch-Slaman decomposition -- A different proof of Seetapun's theorem -- Other applications -- Liu's theorem -- Preliminaries -- Proof of Lemma 8.6.6 -- Proof of Lemma 8.6.7 -- The first order part of RT -- Two versus arbitrarily many colors -- Proof of Proposition 8.7.4 -- Proof of Proposition 8.7.5 -- What else is known? -- The SRT22 vs. COH problem -- Summary: Ramsey's theorem and the ``big five'' -- Exercises -- Other combinatorial principles -- Finer results about RT -- Ramsey's theorem for singletons -- Ramsey's theorem for higher exponents -- Homogeneity vs. limit homogeneity -- Partial and linear orders -- Equivalences and bounds -- Stable partial and linear orders -- Separations over RCA0 -- Variants under finer reducibilities -- Polarized Ramsey's theorem -- Rainbow Ramsey's theorem -- Erdős-Moser theorem -- The Chubb-Hirst-McNicholl tree theorem -- Milliken's tree theorem -- Thin set and free set theorems -- Hindman's theorem -- Apartness, gaps, and finite unions -- Towsner's simple proof -- Variants with bounded sums -- Applications of the Lovász local lemma -- Model theoretic and set theoretic principles -- Languages, theories, and models -- The atomic model theorem -- The finite intersection principle -- Weak weak König's lemma. The reverse mathematics zoo -- Exercises -- Part IV Other areas -- Analysis and topology -- Formalizations of the real line -- Sequences and convergence -- Sets and continuous functions -- Sets of points -- Continuous functions -- The intermediate value theorem -- Closed sets and compactness -- Separably closed sets -- Uniform continuity and boundedness -- Topological dynamics and ergodic theory -- Birkhoff's recurrence theorem -- The Auslander-Ellis theorem and iterated Hindman's theorem -- Measure theory and the mean ergodic theorem -- Additional results in real analysis -- Topology, MF spaces, CSC spaces -- Countable, second countable spaces -- MF spaces -- Reverse mathematics of MF spaces -- Exercises -- Algebra -- Groups, rings, and other structures -- Vector spaces and bases -- The complexity of ideals -- Orderability -- The Nielsen-Schreier theorem -- Other topics -- Exercises -- Set theory and beyond -- Well orderings and ordinals -- The Sigma-1-1 separation principle -- Comparability of well orderings -- Proof of Proposition 12.1.12 -- Descriptive set theory -- Determinacy -- Gale-Stewart games -- Clopen and open determinacy -- Gödel's constructible universe -- Friedman's theorem -- Higher order reverse mathematics -- Exercises -- References -- Index. |
| Record Nr. | UNINA-9910585784903321 |
|
Dzhafarov Damir D.
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
