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.
Advances in proof theory [[electronic resource] /] / edited by Reinhard Kahle, Thomas Strahm, Thomas Studer
| Advances in proof theory [[electronic resource] /] / edited by Reinhard Kahle, Thomas Strahm, Thomas Studer |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2016 |
| Descrizione fisica | 1 online resource (430 p.) |
| Disciplina | 511.3 |
| Collana | Progress in Computer Science and Applied Logic |
| Soggetto topico |
Mathematical logic
Logic Mathematical Logic and Foundations |
| ISBN | 3-319-29198-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | W. Buchholz: A survey on ordinal notations around the Bachmann-Howard ordinal -- A. Cantini: About truth and types -- R. Dyckhoff: Intuitionistic decision procedures since Gentzen -- S. Feferman: The operational perspective -- R. Gore: Formally verified proof-theory using Isabelle/HOL -- P. Minari: Analytic equational proof systems for combinatory logic and lambda calculus -- W. Pohlers: From subsystems of classical analysis to subsystems of set theory - a personal account -- M. Rathjen: Ordinal analysis and witness extraction -- P. Schuster: Logic completeness via open induction -- H. Schwichtenberg: On the computational content of Higman's lemma -- P. Schroeder-Heister: TBA -- A. Setzer: TBA -- S. Wainer: On weak "pointwise" induction, and a miniaturized predicativity. |
| Record Nr. | UNINA-9910254060903321 |
| Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Proof-Theoretic Semantics / / edited by Thomas Piecha, Peter Schroeder-Heister
| Advances in Proof-Theoretic Semantics / / edited by Thomas Piecha, Peter Schroeder-Heister |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (vi, 283 pages) : digital file(s) |
| Disciplina | 160 |
| Collana | Trends in Logic, Studia Logica Library |
| Soggetto topico |
Logic
Mathematical logic Mathematical Logic and Foundations Mathematical Logic and Formal Languages |
| ISBN | 3-319-22686-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction; Thomas Piecha & Peter-Schroeder-Heister -- Chapter 2. On Brouwer-Heyting-Kolmogorov provability semantics; Sergei N. Artëmov -- Chapter 3. Two Ways of General Proof Theory; Kosta Došen -- Chapter 4. Generalised elimination rules; Roy Dyckhoff -- Chapter 5. On the proof theoretic foundations of set theory; Lars Hallnäs -- Chapter 6. The choice of semantics as a methodological question; Wilfrid Hodges -- Chapter 7. The mode of presentation; Reinhard Kahle -- Chapter 8. Remarks on relations between Gentzen and Heyting inspired PTS; Dag Prawitz -- Chapter 9. Unification of logics by reflection; Giovanni Sambin -- Chapter 10. BHK and Brouwer's Theory of the Creative Subject; Göran Sundholm -- Chapter 11. Compositional semantics for predicate logic: Eliminating bound variables from formulas and deductions; William W. Tait -- Chapter 12. Intuitionism, the Paradox of Knowability and Empirical Negation; Gabriele Usberti -- Chapter 13. Explicit composition and its application in normalization proofs; Jan von Plato -- Chapter 14. A two-sorted typed lambda-calculus; Heinrich Wansing -- Chapter 15. Kreisel's second clause and the Theory of Constructions; Walter Dean & Hidenori Kurokawa -- Chapter 16. On Paradoxes in Proof-Theoretic Semantics; Yoshihiro Maruyama. |
| Record Nr. | UNINA-9910137163703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Alfred Tarski [[electronic resource] ] : Early Work in Poland—Geometry and Teaching / / edited by Andrew McFarland, Joanna McFarland, James T. Smith
| Alfred Tarski [[electronic resource] ] : Early Work in Poland—Geometry and Teaching / / edited by Andrew McFarland, Joanna McFarland, James T. Smith |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Birkhäuser, , 2014 |
| Descrizione fisica | 1 online resource (511 p.) |
| Disciplina |
160
370 |
| Soggetto topico |
Mathematical logic
Mathematics—Study and teaching Mathematics History Geometry Mathematical Logic and Foundations Mathematics Education History of Mathematical Sciences |
| ISBN | 1-4939-1474-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Tarski’s first paper -- 1.1 Introduction -- 1.2 Item 1 below (nearing completion) -- 2 Papers on equide composibility of polygons -- 2.1 Introduction -- 2.2 Item 2 below (nearing completion) -- 2.3 Item 6 below (old translation, needs redoing) -- 2.4 Item 8 below (old translation, needs redoing) -- 2.5 Exercise 31pc in item 11g below -- 3 Papers related to secondary teaching -- 3.1 Introduction -- 3.2 Item 4 below (meeting report) -- 3.3 Item 7 below (on circles, nearing completion) -- 3.4 Extract from Item 9 below (textbook) -- 3.5 Remainder of item 11 below (exercises) -- 4 Assorted contributions -- 4.1 Introduction -- 4.2 Item 3 below (on insurance) -- 4.3 Item 5 below (abstract on truth) -- 4.4 Item 10 below (Lukasiewicz abstract on definitions) -- 4.5 Item 12 below (contributions to discussions) -- 5 Bibliography -- 5.1 Introduction -- 5.2 List of Tarski works published since the Collected Works -- 5.3 List of biographical books and articles -- 5.4 List of summaries of Tarski’s scientific work -- 5.5 References for the present book -- Illustrations -- Young Tarski (frontispiece) -- From the first paper -- From the 1924 paper -- Something from one of the teachers’ journals -- Index. |
| Record Nr. | UNINA-9910299976103321 |
| New York, NY : , : Springer New York : , : Imprint : Birkhäuser, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic Logic and Universal Algebra in Computer Science [[electronic resource] ] : Conference, Ames, Iowa, USA June 1–4, 1988 Proceedings / / edited by Clifford H. Bergman, Roger D. Maddux, Don L. Pigozzi
| Algebraic Logic and Universal Algebra in Computer Science [[electronic resource] ] : Conference, Ames, Iowa, USA June 1–4, 1988 Proceedings / / edited by Clifford H. Bergman, Roger D. Maddux, Don L. Pigozzi |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XI, 292 p.) |
| Disciplina | 512 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer logic
Mathematical logic Algorithms Data structures (Computer science) Computer science—Mathematics Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Data Structures Symbolic and Algebraic Manipulation Mathematical Logic and Foundations |
| ISBN | 0-387-34804-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Relatively free relation algebras -- The value of free algebras -- Continuations of logic programs -- On cylindric algebraic model theory -- Dynamic algebras as a well-behaved fragment of relation algebras -- All recursive types defined using products and sums can be implemented using pointers -- The abstract Galois theory: A survey -- The implications in conditional logic -- Optimal semantics of data type extensions -- Other logics for (equational) theories -- Mal'cev algebras for universal algebra terms -- Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic -- The resolution rule: An algebraic perspective -- Incremental models of updating data bases -- Noncommutative cylindric algebras and relativizations of cylindric algebras -- On the ?-definable tree operations. |
| Record Nr. | UNISA-996465940603316 |
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Complexity [[electronic resource] ] : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / / by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri
| Algorithms and Complexity [[electronic resource] ] : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / / by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri |
| Autore | Petreschi Rosella |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 290 p.) |
| Disciplina | 511/.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Algorithms Data structures (Computer science) Computers Computer science—Mathematics Computer graphics Mathematical Logic and Foundations Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-44849-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems. |
| Record Nr. | UNINA-9910143860003321 |
Petreschi Rosella
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Complexity [[electronic resource] ] : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / / by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri
| Algorithms and Complexity [[electronic resource] ] : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / / by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri |
| Autore | Petreschi Rosella |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 290 p.) |
| Disciplina | 511/.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Algorithms Data structures (Computer science) Computers Computer science—Mathematics Computer graphics Mathematical Logic and Foundations Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-44849-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems. |
| Record Nr. | UNISA-996465703903316 |
|
Petreschi Rosella
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Complexity [[electronic resource] ] : Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings / / edited by Giancarlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista
| Algorithms and Complexity [[electronic resource] ] : Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings / / edited by Giancarlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (IX, 319 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Applied mathematics Engineering mathematics Algorithms Data structures (Computer science) Theory of Computation Mathematical Logic and Foundations Applications of Mathematics Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures |
| ISBN | 3-540-68323-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and data structures for control dependence and related compiler problems -- Embedding interconnection networks in grids via the Layered Cross Product -- Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5 -- The optimum cost chromatic partition problem -- Fault tolerant K-center problems -- R 1?tt SN (NP) distinguishes robust many-one and Turing completeness -- Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy -- On the drift of short schedules -- On removing non-degeneracy assumptions in computational geometry -- Maintaining maxima under boundary updates -- An optimal algorithm for one-separation of a set of isothetic polygons -- Nice drawings for planar bipartite graphs -- Area requirement of Gabriel drawings (extended abstract) -- Design of reliable combinatorial algorithms using certificates -- An improved deterministic algorithm for generalized random sampling -- Polynomial time algorithms for some self-duality problems -- A note on updating suffix tree labels -- Relaxed balanced red-black trees -- The algorithmic complexity of chemical threshold testing -- A meticulous analysis of mergesort programs -- BSP-like external-memory computation -- Topological chaos for elementary cellular automata -- On the complexity of balanced Boolean functions -- On sets with easy certificates and the existence of one-way permutations -- Isomorphism for graphs of bounded distance width -- Hardness of approximating problems on cubic graphs -- Tree contractions and evolutionary trees. |
| Record Nr. | UNINA-9910144927003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Complexity [[electronic resource] ] : Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings / / edited by Giancarlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista
| Algorithms and Complexity [[electronic resource] ] : Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings / / edited by Giancarlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (IX, 319 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Applied mathematics Engineering mathematics Algorithms Data structures (Computer science) Theory of Computation Mathematical Logic and Foundations Applications of Mathematics Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures |
| ISBN | 3-540-68323-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and data structures for control dependence and related compiler problems -- Embedding interconnection networks in grids via the Layered Cross Product -- Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5 -- The optimum cost chromatic partition problem -- Fault tolerant K-center problems -- R 1?tt SN (NP) distinguishes robust many-one and Turing completeness -- Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy -- On the drift of short schedules -- On removing non-degeneracy assumptions in computational geometry -- Maintaining maxima under boundary updates -- An optimal algorithm for one-separation of a set of isothetic polygons -- Nice drawings for planar bipartite graphs -- Area requirement of Gabriel drawings (extended abstract) -- Design of reliable combinatorial algorithms using certificates -- An improved deterministic algorithm for generalized random sampling -- Polynomial time algorithms for some self-duality problems -- A note on updating suffix tree labels -- Relaxed balanced red-black trees -- The algorithmic complexity of chemical threshold testing -- A meticulous analysis of mergesort programs -- BSP-like external-memory computation -- Topological chaos for elementary cellular automata -- On the complexity of balanced Boolean functions -- On sets with easy certificates and the existence of one-way permutations -- Isomorphism for graphs of bounded distance width -- Hardness of approximating problems on cubic graphs -- Tree contractions and evolutionary trees. |
| Record Nr. | UNISA-996465982403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII '89 Reinhardsbrunn Castle, GDR, October 1-6, 1989, Proceedings / / edited by Klaus P. Jantke
| Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII '89 Reinhardsbrunn Castle, GDR, October 1-6, 1989, Proceedings / / edited by Klaus P. Jantke |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (IX, 338 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Computer logic Mathematical logic Artificial Intelligence Programming Techniques Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-46798-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Inductive inference from good examples -- Inductive inference, DFAs, and computational complexity -- Why and how program synthesis? -- Some thoughts on the role of examples in program transformation and its relevance for explanation-based learning -- Towards representation independence in PAC learning -- Learning context-free languages efficiently -- Learning programs with an easy to calculate set of errors -- Inductive inference up to immune sets -- Refined query inference -- Learning ?-regular languages from queries and counter-examples (a preliminary report) -- A refutation of Barzdins' conjecture -- Generalizing multiple examples in explanation based learning -- Nested hyper-rectangles for exemplar-based learning -- Second-order inductive learning -- Modes of analogy -- Some aspects of analogy in mathematical reasoning -- A sketch of analogy as reasoning with equality hypotheses -- Analogical inference as generalised inductive inference -- Analogical reasoning for second generation expert systems -- Probabilistic inductive inference of indices in enumerable classes of total recursive functions -- Inductive inference for solving divergence in Knuth-Bendix completion -- Towards a set of inference rules for solving divergence in Knuth-Bendix completion -- Inductive synthesis of programs for symbolic sequences processing -- Inductive synthesis of encoding for algebraic abstract data types. |
| Record Nr. | UNISA-996465729803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Analysis of Dynamical and Cognitive Systems [[electronic resource] ] : Advanced Course, Stockholm, Sweden, August 9 - 14, 1993. Proceedings / / edited by Stig I. Andersson
| Analysis of Dynamical and Cognitive Systems [[electronic resource] ] : Advanced Course, Stockholm, Sweden, August 9 - 14, 1993. Proceedings / / edited by Stig I. Andersson |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (VIII, 268 p.) |
| Disciplina | 003/.85 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Computer communication systems Mathematical logic Biomathematics Artificial Intelligence Computation by Abstract Devices Computer Communication Networks Mathematical Logic and Formal Languages Mathematical Logic and Foundations Mathematical and Computational Biology |
| ISBN | 3-540-49113-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The limits of mathematics course outline and software -- Historical background of Gödel's theorem -- A formal scheme for avoiding undecidable problems. Applications to chaotic behavior characterization and parallel computation -- Cellular neural networks — A tutorial on programmable nonlinear dynamics in space -- Neural coding: A theoretical vista of mechanisms, techniques, and applications -- Hebbian unlearning -- Mapping discounted and undiscounted Markov Decision Problems onto Hopfield neural networks -- “Blob” analysis of biomedical image sequences: A model-based and an inductive approach -- Simplicity criteria for dynamical systems -- Analysis of dynamical systems using predicate transformers: Attraction and composition. |
| Record Nr. | UNISA-996466097503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
