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.
Flexibilisierung der Fabrik Im Kontext Von Industrie 4. 0 / / Michael Schenk
Flexibilisierung der Fabrik Im Kontext Von Industrie 4. 0 / / Michael Schenk
Autore Schenk Michael
Pubbl/distr/stampa Berlin : , : Logos Verlag, , 2017
Descrizione fisica 1 online resource (240 pages)
Disciplina 670.285
Collana Anwendungsorientierte Beiträge zum Industriellen Management
Soggetto topico Flexible manufacturing systems
ISBN 3-8325-9249-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ger
Record Nr. UNINA-9910795595303321
Schenk Michael  
Berlin : , : Logos Verlag, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Flexibilisierung der Fabrik Im Kontext Von Industrie 4. 0 / / Michael Schenk
Flexibilisierung der Fabrik Im Kontext Von Industrie 4. 0 / / Michael Schenk
Autore Schenk Michael
Pubbl/distr/stampa Berlin : , : Logos Verlag, , 2017
Descrizione fisica 1 online resource (240 pages)
Disciplina 670.285
Collana Anwendungsorientierte Beiträge zum Industriellen Management
Soggetto topico Flexible manufacturing systems
ISBN 3-8325-9249-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ger
Record Nr. UNINA-9910815358203321
Schenk Michael  
Berlin : , : Logos Verlag, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Logic, construction, computation [[electronic resource] /] / Ulrich Berger ... [et al.] (eds.)
Logic, construction, computation [[electronic resource] /] / Ulrich Berger ... [et al.] (eds.)
Pubbl/distr/stampa Heusenstamm [Germany], : ontos, 2012
Descrizione fisica 1 online resource (544 p.)
Disciplina 510
Altri autori (Persone) BergerUlrich
Collana Ontos Mathematical Logic
Ontos mathematical logic
Soggetto topico Logic
Computational neuroscience
Soggetto genere / forma Electronic books.
ISBN 3-11-032492-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Preface / Berger, Ulrich / Diener, Hannes / Schuster, Peter / Seisenberger, Monika -- Contents -- Contributors -- A New Use of Friedman's Translation: Interactive Realizability / Aschieri, Federico / Berardi, Stefano -- Polymorphic Logic / Bickford, Mark / Robert, Constable -- Constructive Solutions of Ordinary Differential Equations / Bridges, Douglas S. -- A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy / Buchholz, Wilfried / Weiermann, Andreas -- Conservativity of transitive closure over weak constructive operational set theory / Cantini, Andrea / Crosilla, Laura -- Formal Baire Space in Constructive Set Theory / Curi, Giovanni / Rathjen, Michael -- Functional Interpretations of Classical and Constructive Set Theory / Diller, Justus -- Weak Theories of Truth and Explicit Mathematics / Eberhard, Sebastian / Strahm, Thomas -- Axiomatizing Truth: Why and How? / Feferman, Solomon -- On the Strength of some Semi-Constructive Theories / Feferman, Solomon -- On the Relation Between Various Negative Translations / Ferreira, Gilda / Oliva, Paulo -- A Finite Axiomatisation of Inductive-Inductive Definitions / Forsberg, Fredrik Nordvall / Setzer, Anton -- Some Conservative Extension Results on Classical and Intuitionistic Sequent Calculi / Ishihara, Hajime -- About the Strength of Operational Regularity / Jäger, Gerhard / Zumbrunnen, Rico -- Non-Deterministic Epsilon Substitution for ID1: Effective Proof / Mints, Grigori -- Another Unique Weak König's Lemma WKL!! / Moschovakis, Joan Rand -- The Continuous Functionals as Limit Spaces / Normann, Dag -- Provably Recursive Functions of Reflection / Pohlers, Wolfram / Stegert, Jan-Carl -- A Hierarchy of Ramified Theories Below PRA / Spoors, Elliott J. / Wainer, Stanley S. -- Representing L-Domains as Information Systems / Spreen, Dieter
Record Nr. UNINA-9910464302103321
Heusenstamm [Germany], : ontos, 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Logic, construction, computation [[electronic resource] /] / Ulrich Berger ... [et al.] (eds.)
Logic, construction, computation [[electronic resource] /] / Ulrich Berger ... [et al.] (eds.)
Pubbl/distr/stampa Heusenstamm [Germany], : ontos, 2012
Descrizione fisica 1 online resource (544 p.)
Disciplina 510
Altri autori (Persone) BergerUlrich
Collana Ontos Mathematical Logic
Ontos mathematical logic
Soggetto topico Logic
Computational neuroscience
ISBN 3-11-032492-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Preface / Berger, Ulrich / Diener, Hannes / Schuster, Peter / Seisenberger, Monika -- Contents -- Contributors -- A New Use of Friedman's Translation: Interactive Realizability / Aschieri, Federico / Berardi, Stefano -- Polymorphic Logic / Bickford, Mark / Robert, Constable -- Constructive Solutions of Ordinary Differential Equations / Bridges, Douglas S. -- A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy / Buchholz, Wilfried / Weiermann, Andreas -- Conservativity of transitive closure over weak constructive operational set theory / Cantini, Andrea / Crosilla, Laura -- Formal Baire Space in Constructive Set Theory / Curi, Giovanni / Rathjen, Michael -- Functional Interpretations of Classical and Constructive Set Theory / Diller, Justus -- Weak Theories of Truth and Explicit Mathematics / Eberhard, Sebastian / Strahm, Thomas -- Axiomatizing Truth: Why and How? / Feferman, Solomon -- On the Strength of some Semi-Constructive Theories / Feferman, Solomon -- On the Relation Between Various Negative Translations / Ferreira, Gilda / Oliva, Paulo -- A Finite Axiomatisation of Inductive-Inductive Definitions / Forsberg, Fredrik Nordvall / Setzer, Anton -- Some Conservative Extension Results on Classical and Intuitionistic Sequent Calculi / Ishihara, Hajime -- About the Strength of Operational Regularity / Jäger, Gerhard / Zumbrunnen, Rico -- Non-Deterministic Epsilon Substitution for ID1: Effective Proof / Mints, Grigori -- Another Unique Weak König's Lemma WKL!! / Moschovakis, Joan Rand -- The Continuous Functionals as Limit Spaces / Normann, Dag -- Provably Recursive Functions of Reflection / Pohlers, Wolfram / Stegert, Jan-Carl -- A Hierarchy of Ramified Theories Below PRA / Spoors, Elliott J. / Wainer, Stanley S. -- Representing L-Domains as Information Systems / Spreen, Dieter
Record Nr. UNINA-9910789088803321
Heusenstamm [Germany], : ontos, 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Logic, construction, computation / / Ulrich Berger ... [et al.] (eds.)
Logic, construction, computation / / Ulrich Berger ... [et al.] (eds.)
Pubbl/distr/stampa Heusenstamm [Germany], : ontos, 2012
Descrizione fisica 1 online resource (544 p.)
Disciplina 510
Altri autori (Persone) BergerUlrich
Collana Ontos Mathematical Logic
Ontos mathematical logic
Soggetto topico Logic
Computational neuroscience
ISBN 3-11-032492-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Preface / Berger, Ulrich / Diener, Hannes / Schuster, Peter / Seisenberger, Monika -- Contents -- Contributors -- A New Use of Friedman's Translation: Interactive Realizability / Aschieri, Federico / Berardi, Stefano -- Polymorphic Logic / Bickford, Mark / Robert, Constable -- Constructive Solutions of Ordinary Differential Equations / Bridges, Douglas S. -- A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy / Buchholz, Wilfried / Weiermann, Andreas -- Conservativity of transitive closure over weak constructive operational set theory / Cantini, Andrea / Crosilla, Laura -- Formal Baire Space in Constructive Set Theory / Curi, Giovanni / Rathjen, Michael -- Functional Interpretations of Classical and Constructive Set Theory / Diller, Justus -- Weak Theories of Truth and Explicit Mathematics / Eberhard, Sebastian / Strahm, Thomas -- Axiomatizing Truth: Why and How? / Feferman, Solomon -- On the Strength of some Semi-Constructive Theories / Feferman, Solomon -- On the Relation Between Various Negative Translations / Ferreira, Gilda / Oliva, Paulo -- A Finite Axiomatisation of Inductive-Inductive Definitions / Forsberg, Fredrik Nordvall / Setzer, Anton -- Some Conservative Extension Results on Classical and Intuitionistic Sequent Calculi / Ishihara, Hajime -- About the Strength of Operational Regularity / Jäger, Gerhard / Zumbrunnen, Rico -- Non-Deterministic Epsilon Substitution for ID1: Effective Proof / Mints, Grigori -- Another Unique Weak König's Lemma WKL!! / Moschovakis, Joan Rand -- The Continuous Functionals as Limit Spaces / Normann, Dag -- Provably Recursive Functions of Reflection / Pohlers, Wolfram / Stegert, Jan-Carl -- A Hierarchy of Ramified Theories Below PRA / Spoors, Elliott J. / Wainer, Stanley S. -- Representing L-Domains as Information Systems / Spreen, Dieter
Record Nr. UNINA-9910823773003321
Heusenstamm [Germany], : ontos, 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Logical Approaches to Computational Barriers [[electronic resource] ] : Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings / / edited by Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker
Logical Approaches to Computational Barriers [[electronic resource] ] : Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings / / edited by Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XV, 608 p.)
Disciplina 511.3/52
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Algorithms
Computer science—Mathematics
Artificial intelligence
Bioinformatics
Theory of Computation
Mathematics of Computing
Artificial Intelligence
ISBN 3-540-35468-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Heap-Abstraction for an Object-Oriented Calculus with Thread Classes -- From Constructibility and Absoluteness to Computability and Domain Independence -- Datatype-Generic Reasoning -- The Logical Strength of the Uniform Continuity Theorem -- Elementary Algebraic Specifications of the Rational Function Field -- Random Closed Sets -- Deep Inference and Its Normal Form of Derivations -- Logspace Complexity of Functions and Structures -- Prefix-Like Complexities and Computability in the Limit -- Partial Continuous Functions and Admissible Domain Representations -- An Invariant Cost Model for the Lambda Calculus -- On the Complexity of the Sperner Lemma -- The Church-Turing Thesis: Consensus and Opposition -- Gödel and the Origins of Computer Science -- The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design -- Turing Universality in Dynamical Systems -- Every Sequence Is Decompressible from a Random One -- Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal -- LJQ: A Strongly Focused Calculus for Intuitionistic Logic -- Böhm Trees, Krivine’s Machine and the Taylor Expansion of Lambda-Terms -- What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? -- An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability -- Enumeration Reducibility with Polynomial Time Bounds -- Coinductive Proofs for Basic Real Computation -- A Measure of Space for Computing over the Reals -- On Graph Isomorphism for Restricted Graph Classes -- Infinite Time Register Machines -- Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems -- Forcing with Random Variables and Proof Complexity -- Complexity-Theoretic Hierarchies -- Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests -- Lower Bounds Using Kolmogorov Complexity -- The Jump Classes of Minimal Covers -- Space Bounds for Infinitary Computation -- From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials -- Towards a Trichotomy for Quantified H-Coloring -- Two Open Problems on Effective Dimension -- Optimization and Approximation Problems Related to Polynomial System Solving -- Uncomputability Below the Real Halting Problem -- Constraints on Hypercomputation -- Martingale Families and Dimension in P -- Can General Relativistic Computers Break the Turing Barrier? -- Degrees of Weakly Computable Reals -- Understanding and Using Spector’s Bar Recursive Interpretation of Classical Analysis -- A Subrecursive Refinement of the Fundamental Theorem of Algebra -- An Introduction to Program and Thread Algebra -- Fast Quantifier Elimination Means P = NP -- Admissible Representations in Computable Analysis -- Do Noetherian Modules Have Noetherian Basis Functions? -- Inverting Monotone Continuous Functions in Constructive Analysis -- Partial Recursive Functions in Martin-Löf Type Theory -- Partially Ordered Connectives and ?1 1 on Finite Models -- Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes -- Gödel’s Conflicting Approaches to Effective Calculability -- Co-total Enumeration Degrees -- Relativized Degree Spectra -- Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions -- Non-deterministic Halting Times for Hamkins-Kidder Turing Machines -- Kurt Gödel and Computability Theory -- A Computability Theory of Real Numbers -- Primitive Recursive Selection Functions over Abstract Algebras.
Record Nr. UNISA-996465744603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui