top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
The Journal of Computational Multiphase Flows
The Journal of Computational Multiphase Flows
Pubbl/distr/stampa Thousand Oaks, CA : , : SAGE Publications, , 2009-
Descrizione fisica 1 online resource
Soggetto topico Multiphase flow - Research
Computable functions
Fluid dynamics
Mathematics
Numerical analysis
Matemàtica
Física
Soggetto genere / forma Periodicals.
Revistes electròniques.
ISSN 1757-4838
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Record Nr. UNINA-9910384257503321
Thousand Oaks, CA : , : SAGE Publications, , 2009-
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon
Autore Downey R. G (Rod G.)
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , 2020
Descrizione fisica 1 online resource (104 pages)
Disciplina 511.3/5
Collana Memoirs of the American Mathematical Society
Soggetto topico Unsolvability (Mathematical logic)
Recursively enumerable sets
Computable functions
Soggetto genere / forma Electronic books.
ISBN 1-4704-6136-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910480828103321
Downey R. G (Rod G.)  
Providence, Rhode Island : , : American Mathematical Society, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon
Autore Downey R. G (Rod G.)
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , 2020
Descrizione fisica 1 online resource (104 pages)
Disciplina 511.3/5
Collana Memoirs of the American Mathematical Society
Soggetto topico Unsolvability (Mathematical logic)
Recursively enumerable sets
Computable functions
ISBN 1-4704-6136-6
Classificazione 03D2503D2803D30
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Informal construction -- Formal construction -- Limiting results.
Record Nr. UNINA-9910794003503321
Downey R. G (Rod G.)  
Providence, Rhode Island : , : American Mathematical Society, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon
Autore Downey R. G (Rod G.)
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , 2020
Descrizione fisica 1 online resource (104 pages)
Disciplina 511.3/5
Collana Memoirs of the American Mathematical Society
Soggetto topico Unsolvability (Mathematical logic)
Recursively enumerable sets
Computable functions
ISBN 1-4704-6136-6
Classificazione 03D2503D2803D30
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Informal construction -- Formal construction -- Limiting results.
Record Nr. UNINA-9910812917203321
Downey R. G (Rod G.)  
Providence, Rhode Island : , : American Mathematical Society, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proceedings of the ... Annual ACM Symposium on Theory of Computing
Proceedings of the ... Annual ACM Symposium on Theory of Computing
Pubbl/distr/stampa New York, N.Y., : Association for Computing Machinery, ©1982-
Descrizione fisica 1 online resource
Disciplina 511
Soggetto topico Machine theory
Computable functions
Computational complexity
Wiskunde
Computers
Soggetto genere / forma Periodicals.
Conference papers and proceedings.
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti Proceedings of the ... ACM International Symposium on Theory of Computing
Record Nr. UNISA-996207092803316
New York, N.Y., : Association for Computing Machinery, ©1982-
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Proofs and computations / / Helmut Schwichtenberg, Stanley S. Wainer [[electronic resource]]
Proofs and computations / / Helmut Schwichtenberg, Stanley S. Wainer [[electronic resource]]
Autore Schwichtenberg Helmut <1942->
Pubbl/distr/stampa Cambridge : , : Cambridge University Press, , 2012
Descrizione fisica 1 online resource (xiii, 465 pages) : digital, PDF file(s)
Disciplina 511.352
Collana Perspectives in logic
Soggetto topico Computable functions
Proof theory
ISBN 1-107-22428-4
1-280-48485-3
1-139-22192-2
9786613579836
1-139-21710-0
1-139-21403-9
1-139-22363-1
1-139-22020-9
1-139-03190-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1.4. Soundness and completeness of the classical fragment1.4.1. Models.; 1.4.2. Soundness of classical logic.; 1.4.3. Completeness of classical logic.; 1.4.4. Compactness and Löwenheim-Skolem theorems.; 1.5. Tait calculus; 1.6. Notes; Chapter 2: RECURSION THEORY; 2.1. Register machines; 2.1.1. Programs.; 2.1.2. Program constructs.; 2.1.3. Register machine computable functions.; 2.2. Elementary functions; 2.2.1. Definition and simple properties.; 2.2.2. Elementary relations.; 2.2.3. The class ε.; 2.2.4. Closure properties of ε.; 2.2.5. Coding finite lists.; 2.3. Kleene's normal form theorem
2.3.1. Program numbers.2.3.2. Normal form.; 2.3.3. Σo1-definable relations and μ-recursive functions.; 2.3.4. Computable functions.; 2.3.5. Undecidability of the halting problem.; 2.4. Recursive definitions; 2.4.1. Least fixed points of recursive definitions.; 2.4.2. The principles of finite support and monotonicity, and the effective index property.; 2.4.3. Recursion theorem.; 2.4.4. Recursive programs and partial recursive functions.; 2.4.5. Relativized recursion.; 2.5. Primitive recursion and for-loops; 2.5.1. Primitive recursive functions.; 2.5.2. Loop-programs.
2.5.3. Reduction to primitive recursion.2.5.4. A complexity hierarchy for Prim.; 2.6. The arithmetical hierarchy; 2.6.1. Kleene's second recursion theorem.; 2.6.2. Characterization of Σ01-definable and recursive relations.; 2.6.3. Arithmetical relations.; 2.6.4. Closure properties.; 2.6.6. Σ0r-complete relations.; 2.7. The analytical hierarchy; 2.7.1. Analytical relations.; 2.7.2. Closure properties.; 2.7.3. Universal Σ1r+1-definable relations.; 2.7.4. Σ1r-complete relations.; 2.8. Recursive type-2 functionals and well-foundedness; 2.8.1. Computation trees.; 2.8.2. Ordinal assignments
recursive ordinals.
Altri titoli varianti Proofs & Computations
Record Nr. UNINA-9910461496003321
Schwichtenberg Helmut <1942->  
Cambridge : , : Cambridge University Press, , 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proofs and computations / / Helmut Schwichtenberg, Stanley S. Wainer [[electronic resource]]
Proofs and computations / / Helmut Schwichtenberg, Stanley S. Wainer [[electronic resource]]
Autore Schwichtenberg Helmut <1942->
Pubbl/distr/stampa Cambridge : , : Cambridge University Press, , 2012
Descrizione fisica 1 online resource (xiii, 465 pages) : digital, PDF file(s)
Disciplina 511.352
Collana Perspectives in logic
Soggetto topico Computable functions
Proof theory
ISBN 1-107-22428-4
1-280-48485-3
1-139-22192-2
9786613579836
1-139-21710-0
1-139-21403-9
1-139-22363-1
1-139-22020-9
1-139-03190-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1.4. Soundness and completeness of the classical fragment1.4.1. Models.; 1.4.2. Soundness of classical logic.; 1.4.3. Completeness of classical logic.; 1.4.4. Compactness and Löwenheim-Skolem theorems.; 1.5. Tait calculus; 1.6. Notes; Chapter 2: RECURSION THEORY; 2.1. Register machines; 2.1.1. Programs.; 2.1.2. Program constructs.; 2.1.3. Register machine computable functions.; 2.2. Elementary functions; 2.2.1. Definition and simple properties.; 2.2.2. Elementary relations.; 2.2.3. The class ε.; 2.2.4. Closure properties of ε.; 2.2.5. Coding finite lists.; 2.3. Kleene's normal form theorem
2.3.1. Program numbers.2.3.2. Normal form.; 2.3.3. Σo1-definable relations and μ-recursive functions.; 2.3.4. Computable functions.; 2.3.5. Undecidability of the halting problem.; 2.4. Recursive definitions; 2.4.1. Least fixed points of recursive definitions.; 2.4.2. The principles of finite support and monotonicity, and the effective index property.; 2.4.3. Recursion theorem.; 2.4.4. Recursive programs and partial recursive functions.; 2.4.5. Relativized recursion.; 2.5. Primitive recursion and for-loops; 2.5.1. Primitive recursive functions.; 2.5.2. Loop-programs.
2.5.3. Reduction to primitive recursion.2.5.4. A complexity hierarchy for Prim.; 2.6. The arithmetical hierarchy; 2.6.1. Kleene's second recursion theorem.; 2.6.2. Characterization of Σ01-definable and recursive relations.; 2.6.3. Arithmetical relations.; 2.6.4. Closure properties.; 2.6.6. Σ0r-complete relations.; 2.7. The analytical hierarchy; 2.7.1. Analytical relations.; 2.7.2. Closure properties.; 2.7.3. Universal Σ1r+1-definable relations.; 2.7.4. Σ1r-complete relations.; 2.8. Recursive type-2 functionals and well-foundedness; 2.8.1. Computation trees.; 2.8.2. Ordinal assignments
recursive ordinals.
Altri titoli varianti Proofs & Computations
Record Nr. UNINA-9910790463503321
Schwichtenberg Helmut <1942->  
Cambridge : , : Cambridge University Press, , 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proofs and computations / / Helmut Schwichtenberg, Stanley S. Wainer [[electronic resource]]
Proofs and computations / / Helmut Schwichtenberg, Stanley S. Wainer [[electronic resource]]
Autore Schwichtenberg Helmut <1942->
Pubbl/distr/stampa Cambridge : , : Cambridge University Press, , 2012
Descrizione fisica 1 online resource (xiii, 465 pages) : digital, PDF file(s)
Disciplina 511.352
Collana Perspectives in logic
Soggetto topico Computable functions
Proof theory
ISBN 1-107-22428-4
1-280-48485-3
1-139-22192-2
9786613579836
1-139-21710-0
1-139-21403-9
1-139-22363-1
1-139-22020-9
1-139-03190-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1.4. Soundness and completeness of the classical fragment1.4.1. Models.; 1.4.2. Soundness of classical logic.; 1.4.3. Completeness of classical logic.; 1.4.4. Compactness and Löwenheim-Skolem theorems.; 1.5. Tait calculus; 1.6. Notes; Chapter 2: RECURSION THEORY; 2.1. Register machines; 2.1.1. Programs.; 2.1.2. Program constructs.; 2.1.3. Register machine computable functions.; 2.2. Elementary functions; 2.2.1. Definition and simple properties.; 2.2.2. Elementary relations.; 2.2.3. The class ε.; 2.2.4. Closure properties of ε.; 2.2.5. Coding finite lists.; 2.3. Kleene's normal form theorem
2.3.1. Program numbers.2.3.2. Normal form.; 2.3.3. Σo1-definable relations and μ-recursive functions.; 2.3.4. Computable functions.; 2.3.5. Undecidability of the halting problem.; 2.4. Recursive definitions; 2.4.1. Least fixed points of recursive definitions.; 2.4.2. The principles of finite support and monotonicity, and the effective index property.; 2.4.3. Recursion theorem.; 2.4.4. Recursive programs and partial recursive functions.; 2.4.5. Relativized recursion.; 2.5. Primitive recursion and for-loops; 2.5.1. Primitive recursive functions.; 2.5.2. Loop-programs.
2.5.3. Reduction to primitive recursion.2.5.4. A complexity hierarchy for Prim.; 2.6. The arithmetical hierarchy; 2.6.1. Kleene's second recursion theorem.; 2.6.2. Characterization of Σ01-definable and recursive relations.; 2.6.3. Arithmetical relations.; 2.6.4. Closure properties.; 2.6.6. Σ0r-complete relations.; 2.7. The analytical hierarchy; 2.7.1. Analytical relations.; 2.7.2. Closure properties.; 2.7.3. Universal Σ1r+1-definable relations.; 2.7.4. Σ1r-complete relations.; 2.8. Recursive type-2 functionals and well-foundedness; 2.8.1. Computation trees.; 2.8.2. Ordinal assignments
recursive ordinals.
Altri titoli varianti Proofs & Computations
Record Nr. UNINA-9910827294203321
Schwichtenberg Helmut <1942->  
Cambridge : , : Cambridge University Press, , 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Recursion on the countable functionals / / D. Normann
Recursion on the countable functionals / / D. Normann
Autore Normann Dag <1947->
Edizione [1st ed. 1980.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1980]
Descrizione fisica 1 online resource (X, 198 p.)
Disciplina 511.35
Collana Lecture Notes in Mathematics
Soggetto topico Computable functions
Recursion theory
Logic, Symbolic and mathematical
ISBN 3-540-38170-8
Classificazione 03D20
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The maximal type structure -- The countable functionals -- Ct(n) as a topological space -- Computability vs recursion -- The computable structure on Ct(k) -- Sections -- Some further results and topics.
Record Nr. UNISA-996466576903316
Normann Dag <1947->  
Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1980]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Recursion on the countable functionals / Dag Normann
Recursion on the countable functionals / Dag Normann
Autore Normann, Dag
Pubbl/distr/stampa Berlin ; New York : Springer-Verlag, 1980
Descrizione fisica viii, 190 p. ; 25 cm.
Disciplina 511.3
Collana Lecture notes in mathematics, 0075-8434 ; 811
Soggetto topico Computable functions
Functionals
Recursion theory
ISBN 3540100199
Classificazione AMS 03D65
QA3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991001291049707536
Normann, Dag  
Berlin ; New York : Springer-Verlag, 1980
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui