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.
Computer Science Logic [[electronic resource] ] : 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers / / edited by Leszek Pacholski, Jerzy Tiuryn
| Computer Science Logic [[electronic resource] ] : 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers / / edited by Leszek Pacholski, Jerzy Tiuryn |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XI, 553 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Mathematical logic Computer logic Artificial intelligence Theory of Computation Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Artificial Intelligence |
| ISBN | 3-540-49404-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Subtyping with singleton types -- A subtyping for the Fisher-Honsell-Mitchell lambda calculus of objects -- The Girard Translation extended with recursion -- Decidability of higher-order subtyping with intersection types -- A ?-calculus structure isomorphic to Gentzen-style sequent calculus structure -- Usability: formalising (un)definedness in typed lambda calculus -- Lambda representation of operations between different term algebras -- Semi-unification and generalizations of a particularly simple form -- A mixed linear and non-linear logic: Proofs, terms and models -- Cut free formalization of logic with finitely many variables. Part I. -- How to lie without being (easily) convicted and the lengths of proofs in propositional calculus -- Monadic second-order logic and linear orderings of finite structures -- First-order spectra with one binary predicate -- Monadic logical definability of NP-complete problems -- Logics for context-free languages -- Log-approximable minimization problems on random inputs -- Convergence and 0–1 laws for L ?,? k under arbitrary measures -- Is first order contained in an initial segment of PTIME? -- Logic programming in Tau Categories -- Reasoning and rewriting with set-relations I: Ground completeness -- Resolution games and non-liftable resolution orderings -- On existential theories of list concatenation -- Completeness of resolution for definite answers with case analysis -- Subrecursion as a basis for a feasible programming language -- A sound metalogical semantics for input/output effects -- An intuitionistic modal logic with applications to the formal verification of hardware -- Towards machine-checked compiler correctness for higher-order pure functional languages -- Powerdomains, powerstructures and fairness -- Canonical forms for data-specifications -- An algebraic view of structural induction -- On the interpretation of type theory in locally cartesian closed categories -- Algorithmic aspects of propositional tense logics -- Stratified default theories -- A homomorphism concept for ?-regularity -- Ramified recurrence and computational complexity II: Substitution and poly-space -- General form recursive equations I -- Modal logics preserving admissible for S4 inference rules -- A bounded set theory with Anti-Foundation Axiom and inductive definability. |
| Record Nr. | UNISA-996466138903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Model theory of algebra and arithmetic : proceedings of the conference on Applications of logic to algebra and arithmetic, held at Karpacz, Poland, September 1-7, 1979 / / edited by L. Pacholski, J. Wierzejewski, A. J. Wilkie
| Model theory of algebra and arithmetic : proceedings of the conference on Applications of logic to algebra and arithmetic, held at Karpacz, Poland, September 1-7, 1979 / / edited by L. Pacholski, J. Wierzejewski, A. J. Wilkie |
| Edizione | [1st ed. 1980.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [1980] |
| Descrizione fisica | 1 online resource (VIII, 412 p.) |
| Disciplina | 511.34 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico | Model theory |
| ISBN | 3-540-38393-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Further remarks on the elementary theory of formal power series rings -- Elimination of quantifiers for non semi-simple rings of characteristic p -- The quantifier elimination problem for rings without nilpotent elements and for semi-simple rings -- Existentially closed modules: Types and prime models -- Rings of continuous functions: Decision problems -- Weak partition relations, finite games, and independence results in Peano arithmetic -- Hensel fields in equal characteristic p>0 -- On polynomials over real closed rings -- Les corps faiblement algebriquement clos non separablement clos ont la propriete d’independance -- Horn-theories of abelian groups -- Two orderings of the class of all countable models of peano arithmetic -- Ramsey quantifiers in arithmetic -- Computational complexity of decision problems in elementary number theory -- Some diophantine nullstellensätze -- A tree analysis of unprovable combinatorial statements -- A hierarchy of cuts in models of arithmetic -- Cofinal extension preserves recursive saturation -- Some model theory and number theory for models of weak systems of arithmetic -- Applications of complexity theory to ?o-definability Problems in arithmetic -- Minimally saturated models -- Totally categorical theories: Structural properties and the non-finite axiomatizability. |
| Record Nr. | UNISA-996466643003316 |
| Berlin, Germany : , : Springer, , [1980] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2001: Theory and Practice of Informatics [[electronic resource] ] : 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001. Proceedings / / edited by Leszek Pacholski, Peter Ruzicka
| SOFSEM 2001: Theory and Practice of Informatics [[electronic resource] ] : 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001. Proceedings / / edited by Leszek Pacholski, Peter Ruzicka |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 350 p.) |
| Disciplina | 001.64 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer communication systems Artificial intelligence Computer science—Mathematics Software Engineering/Programming and Operating Systems Theory of Computation Computer Communication Networks Artificial Intelligence Mathematics of Computing Information Systems and Communication Service |
| ISBN | 3-540-45627-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Potential of Grid, Virtual Laboratories and Virtual Organizations for Bio-sciences -- Agreement Problems in Fault-Tolerant Distributed Systems -- Negotiating the Semantic Gap: From Feature Maps to Semantic Landscapes -- Inference in Rule-Based Systems by Interpolation and Extrapolation Revisited -- Recent Advances in Wavelength Routing -- From Metacomputing to Grid Computing: Evolution or Revolution? -- Knowledge-Based Control Systems -- Beyond the Turing Limit: Evolving Interactive Systems -- Distributed Computations by Autonomous Mobile Robots -- Formal Verification Methods for Industrial Hardware Design -- How Can Computer Science Contribute to Knowledge Discovery -- Contributed Papers -- On the Approximability of Interactive Knapsack Problems -- Model Checking Communication Protocols -- Pipelined Decomposable BSP Computers -- Quantum versus Probabilistic One-Way Finite Automata with Counter -- How to Employ Reverse Search in Distributed Single Source Shortest Paths -- Multi-agent Systems as Concurrent Constraint Processes -- ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs -- Approximative Learning of Regular Languages -- Quantum Finite State Transducers -- Lemmatizer for Document Information Retrieval Systems in JAVA -- The Reconstruction of Polyominoes from Approximately Orthogonal Projections -- Bounding Lamport’s Bakery Algorithm -- Fast Independent Component Analysis in Kernel Feature Spaces -- On Majority Voting Games in Trees -- Time and Space Complexity of Reversible Pebbling -- The HiQoS Rendering System -- Two-Way Restarting Automata and J-Monotonicity -- P-Hardness of Equivalence Testing on Finite-State Processes -- Keynote Talk -- Software Geography: Physical and Economic Aspects. |
| Record Nr. | UNISA-996465879903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2001: Theory and Practice of Informatics : 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001. Proceedings / / edited by Leszek Pacholski, Peter Ruzicka
| SOFSEM 2001: Theory and Practice of Informatics : 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001. Proceedings / / edited by Leszek Pacholski, Peter Ruzicka |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 350 p.) |
| Disciplina | 001.64 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer communication systems Artificial intelligence Computer science—Mathematics Software Engineering/Programming and Operating Systems Theory of Computation Computer Communication Networks Artificial Intelligence Mathematics of Computing Information Systems and Communication Service |
| ISBN | 3-540-45627-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Potential of Grid, Virtual Laboratories and Virtual Organizations for Bio-sciences -- Agreement Problems in Fault-Tolerant Distributed Systems -- Negotiating the Semantic Gap: From Feature Maps to Semantic Landscapes -- Inference in Rule-Based Systems by Interpolation and Extrapolation Revisited -- Recent Advances in Wavelength Routing -- From Metacomputing to Grid Computing: Evolution or Revolution? -- Knowledge-Based Control Systems -- Beyond the Turing Limit: Evolving Interactive Systems -- Distributed Computations by Autonomous Mobile Robots -- Formal Verification Methods for Industrial Hardware Design -- How Can Computer Science Contribute to Knowledge Discovery -- Contributed Papers -- On the Approximability of Interactive Knapsack Problems -- Model Checking Communication Protocols -- Pipelined Decomposable BSP Computers -- Quantum versus Probabilistic One-Way Finite Automata with Counter -- How to Employ Reverse Search in Distributed Single Source Shortest Paths -- Multi-agent Systems as Concurrent Constraint Processes -- ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs -- Approximative Learning of Regular Languages -- Quantum Finite State Transducers -- Lemmatizer for Document Information Retrieval Systems in JAVA -- The Reconstruction of Polyominoes from Approximately Orthogonal Projections -- Bounding Lamport’s Bakery Algorithm -- Fast Independent Component Analysis in Kernel Feature Spaces -- On Majority Voting Games in Trees -- Time and Space Complexity of Reversible Pebbling -- The HiQoS Rendering System -- Two-Way Restarting Automata and J-Monotonicity -- P-Hardness of Equivalence Testing on Finite-State Processes -- Keynote Talk -- Software Geography: Physical and Economic Aspects. |
| Record Nr. | UNINA-9910767575703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||