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.
Aspects of complexity [[electronic resource] ] : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / / editors Rod Downey, Denis Hirschfeldt
Aspects of complexity [[electronic resource] ] : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / / editors Rod Downey, Denis Hirschfeldt
Edizione [Reprint 2010]
Pubbl/distr/stampa Berlin ; ; New York, : Walter de Gruyter, 2001
Descrizione fisica 1 online resource (180 p.)
Disciplina 511.3
Altri autori (Persone) DowneyR. G (Rod G.)
HirschfeldtDenis Roman
Collana De Gruyter series in logic and its applications
Soggetto topico Computational complexity
Machine theory
Soggetto genere / forma Electronic books.
ISBN 3-11-088917-X
Classificazione SD 2000
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Basic complexity / Allender, Eric / McCartin, Catherine -- Three lectures on real computation / Cucker, Felipe -- Parameterized complexity: new developments and research frontiers / Fellows, Michael R. -- Kolmogorov complexity / Fortnow, Lance -- Complexity and computation in matrix groups / Niemeyer, Alice C. / Praeger, Cheryl E. -- The complexity of counting problems / Welsh, Dominic / Gale, Amy -- The Ω conjecture / Woodin, W. Hugh -- List of contributors
Record Nr. UNINA-9910461999603321
Berlin ; ; New York, : Walter de Gruyter, 2001
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Aspects of complexity [[electronic resource] ] : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / / editors Rod Downey, Denis Hirschfeldt
Aspects of complexity [[electronic resource] ] : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / / editors Rod Downey, Denis Hirschfeldt
Edizione [Reprint 2010]
Pubbl/distr/stampa Berlin ; ; New York, : Walter de Gruyter, 2001
Descrizione fisica 1 online resource (180 p.)
Disciplina 511.3
Altri autori (Persone) DowneyR. G (Rod G.)
HirschfeldtDenis Roman
Collana De Gruyter series in logic and its applications
Soggetto topico Computational complexity
Machine theory
ISBN 3-11-088917-X
Classificazione SD 2000
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Basic complexity / Allender, Eric / McCartin, Catherine -- Three lectures on real computation / Cucker, Felipe -- Parameterized complexity: new developments and research frontiers / Fellows, Michael R. -- Kolmogorov complexity / Fortnow, Lance -- Complexity and computation in matrix groups / Niemeyer, Alice C. / Praeger, Cheryl E. -- The complexity of counting problems / Welsh, Dominic / Gale, Amy -- The Ω conjecture / Woodin, W. Hugh -- List of contributors
Record Nr. UNINA-9910785819303321
Berlin ; ; New York, : Walter de Gruyter, 2001
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Mathematical logic in Asia [[electronic resource] ] : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / / editors, S.S. Goncharov, R. Downey, H. Ono
Mathematical logic in Asia [[electronic resource] ] : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / / editors, S.S. Goncharov, R. Downey, H. Ono
Pubbl/distr/stampa Singapore ; ; Hackensack, NJ, : World Scientific, c2006
Descrizione fisica 1 online resource (328p.)
Disciplina 511.3
Altri autori (Persone) DowneyR. G (Rod G.)
GoncharovS. S
OnoH
Soggetto topico Logic, Symbolic and mathematical
Mathematics
Soggetto genere / forma Electronic books.
ISBN 1-281-92443-1
9786611924430
981-277-274-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Another Characterization of the Deduction-Detachment Theorem (S V Babyonyshev); On Behavior of 2-Formulas in Weakly o-Minimal Theories (B S Baizhanov 38; B Sh Kulpeshov); Arithmetic Turing Degrees and Categorical Theories of Computable Models (E Fokina); Negative Data in Learning Languages (S Jain 38; E Kinber); Effective Cardinals in the Nonstandard Universe (V Kanovei 38; M Reeken); Model-Theoretic Methods of Analysis of Computer Arithmetic (S P Kovalyov); The Functional Completeness of Leniewski's Systems (F Lepage); Hierarchies of Randomness Tests (J Reimann 38; F Stephan); Intransitive Linear Temporal Logic Based on Integer Numbers, Decidability, Admissible Logical Consecutions (V V Rybakov); The Logic of Prediction (E Vityaev); Conceptual Semantic Systems Theory and Applications (K E Wolff); Complexity Results on Minimal Unsatisfiable Formulas (X Zhao); and other papers.
Record Nr. UNINA-9910450959203321
Singapore ; ; Hackensack, NJ, : World Scientific, c2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Mathematical logic in Asia [[electronic resource] ] : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / / editors, S.S. Goncharov, R. Downey, H. Ono
Mathematical logic in Asia [[electronic resource] ] : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / / editors, S.S. Goncharov, R. Downey, H. Ono
Pubbl/distr/stampa Singapore ; ; Hackensack, NJ, : World Scientific, c2006
Descrizione fisica 1 online resource (328p.)
Disciplina 511.3
Altri autori (Persone) DowneyR. G (Rod G.)
GoncharovS. S
OnoH
Soggetto topico Logic, Symbolic and mathematical
Mathematics
ISBN 1-281-92443-1
9786611924430
981-277-274-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Another Characterization of the Deduction-Detachment Theorem (S V Babyonyshev); On Behavior of 2-Formulas in Weakly o-Minimal Theories (B S Baizhanov 38; B Sh Kulpeshov); Arithmetic Turing Degrees and Categorical Theories of Computable Models (E Fokina); Negative Data in Learning Languages (S Jain 38; E Kinber); Effective Cardinals in the Nonstandard Universe (V Kanovei 38; M Reeken); Model-Theoretic Methods of Analysis of Computer Arithmetic (S P Kovalyov); The Functional Completeness of Leniewski's Systems (F Lepage); Hierarchies of Randomness Tests (J Reimann 38; F Stephan); Intransitive Linear Temporal Logic Based on Integer Numbers, Decidability, Admissible Logical Consecutions (V V Rybakov); The Logic of Prediction (E Vityaev); Conceptual Semantic Systems Theory and Applications (K E Wolff); Complexity Results on Minimal Unsatisfiable Formulas (X Zhao); and other papers.
Record Nr. UNINA-9910777305203321
Singapore ; ; Hackensack, NJ, : World Scientific, c2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Mathematical logic in Asia : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / / editors, S.S. Goncharov, R. Downey, H. Ono
Mathematical logic in Asia : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / / editors, S.S. Goncharov, R. Downey, H. Ono
Edizione [1st ed.]
Pubbl/distr/stampa Singapore ; ; Hackensack, NJ, : World Scientific, c2006
Descrizione fisica 1 online resource (328p.)
Disciplina 511.3
Altri autori (Persone) DowneyR. G (Rod G.)
GoncharovS. S
OnoHiroakira
Soggetto topico Logic, Symbolic and mathematical
Mathematics
ISBN 9786611924430
9781281924438
1281924431
9789812772749
981277274X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Another Characterization of the Deduction-Detachment Theorem (S V Babyonyshev); On Behavior of 2-Formulas in Weakly o-Minimal Theories (B S Baizhanov 38; B Sh Kulpeshov); Arithmetic Turing Degrees and Categorical Theories of Computable Models (E Fokina); Negative Data in Learning Languages (S Jain 38; E Kinber); Effective Cardinals in the Nonstandard Universe (V Kanovei 38; M Reeken); Model-Theoretic Methods of Analysis of Computer Arithmetic (S P Kovalyov); The Functional Completeness of Leniewski's Systems (F Lepage); Hierarchies of Randomness Tests (J Reimann 38; F Stephan); Intransitive Linear Temporal Logic Based on Integer Numbers, Decidability, Admissible Logical Consecutions (V V Rybakov); The Logic of Prediction (E Vityaev); Conceptual Semantic Systems Theory and Applications (K E Wolff); Complexity Results on Minimal Unsatisfiable Formulas (X Zhao); and other papers.
Altri titoli varianti Proceedings of the 9th Asian Logic Conference
Ninth Asian Logic Conference
Record Nr. UNINA-9910972930803321
Singapore ; ; Hackensack, NJ, : World Scientific, c2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proceedings of the 12th Asian Logic Conference : Wellington, New Zealand, 15-20 December, 2011 / / edited by Rod Downey, Victoria University, New Zealand, Jorg Brendle, Kobe University, Japan, Robert Goldblatt, Victoria University, New Zealand, Byunghan Kim, Yonsei University, Korea
Proceedings of the 12th Asian Logic Conference : Wellington, New Zealand, 15-20 December, 2011 / / edited by Rod Downey, Victoria University, New Zealand, Jorg Brendle, Kobe University, Japan, Robert Goldblatt, Victoria University, New Zealand, Byunghan Kim, Yonsei University, Korea
Pubbl/distr/stampa Singapore, : World Scientific Pub. Co., 2013
Descrizione fisica 1 online resource (viii, 337 pages) : illustrations (some color)
Disciplina 511.3
Collana Gale eBooks
Soggetto topico Logic, Symbolic and mathematical
Soggetto genere / forma Conference proceedings.
ISBN 981-4449-27-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R. G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs
5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M. J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A. R. Day and D. D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms
AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References
Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax - L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models
3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with [ ] and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models
3. Axiomatic Theories L and Ls
Record Nr. UNINA-9910786869003321
Singapore, : World Scientific Pub. Co., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proceedings of the 12th Asian Logic Conference : Wellington, New Zealand, 15-20 December, 2011 / / edited by Rod Downey, Victoria University, New Zealand, Jorg Brendle, Kobe University, Japan, Robert Goldblatt, Victoria University, New Zealand, Byunghan Kim, Yonsei University, Korea
Proceedings of the 12th Asian Logic Conference : Wellington, New Zealand, 15-20 December, 2011 / / edited by Rod Downey, Victoria University, New Zealand, Jorg Brendle, Kobe University, Japan, Robert Goldblatt, Victoria University, New Zealand, Byunghan Kim, Yonsei University, Korea
Pubbl/distr/stampa Singapore, : World Scientific Pub. Co., 2013
Descrizione fisica 1 online resource (viii, 337 pages) : illustrations (some color)
Disciplina 511.3
Collana Gale eBooks
Soggetto topico Logic, Symbolic and mathematical
Soggetto genere / forma Conference proceedings.
ISBN 981-4449-27-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R. G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs
5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M. J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A. R. Day and D. D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms
AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References
Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax - L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models
3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with [ ] and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models
3. Axiomatic Theories L and Ls
Record Nr. UNINA-9910809486603321
Singapore, : World Scientific Pub. Co., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proceedings of the 12th Asian Logic Conference, Wellington, New Zealand, 15-20 December 2011 [[electronic resource] /] / edited by Rod Downey ... [et al.]
Proceedings of the 12th Asian Logic Conference, Wellington, New Zealand, 15-20 December 2011 [[electronic resource] /] / edited by Rod Downey ... [et al.]
Pubbl/distr/stampa Singapore, : World Scientific Pub. Co., 2013
Descrizione fisica 1 online resource (346 p.)
Disciplina 511.3
Altri autori (Persone) DowneyR. G (Rod G.)
Soggetto topico Logic, Symbolic and mathematical
Soggetto genere / forma Electronic books.
ISBN 981-4449-27-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R. G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs
5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M. J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A. R. Day and D. D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms
AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References
Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax - L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models
3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with [ ] and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models
3. Axiomatic Theories L and Ls
Record Nr. UNINA-9910462813403321
Singapore, : World Scientific Pub. Co., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui