Computer science logic : 15th international workshop, CSL 2001 : 10th annual conference of the EACSL, Paris, France, September 10-13, 2001 : proceedings
Uloženo v:
| Korporace: | , |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2142 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computer science logic, 15th international workshop, CSL 2001, 10th annual conference of the EACSL, Paris, France, September 10-13, 2001, proceedings, Laurent Fribourg (ed.), 2001, Berlin, Springer, 1 vol. (XII-614 p.), Lecture notes in computer science, 3-540-42554-3 • Computer Science Logic, Texte imprimé, 9783662204290 |
| LEADER | 04955nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 948628 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155177249 | ||
| 020 | |a 9783540448020 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Workshop on computer science logic |n (15 |d :2001 |c :Paris). | |
| 245 | 1 | 0 | |a Computer science logic : |b 15th international workshop, CSL 2001 : 10th annual conference of the EACSL, Paris, France, September 10-13, 2001 : proceedings |c [edited by] Laurent Fribourg. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2142 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Papers -- Local Reasoning about Programs that Alter Data Structures -- Applications of Alfred Tarski s Ideas in Database Theory -- Locus Solum: From the Rules of Logic to the Logic of Rules -- Contributed Papers -- The Expressive Power of Horn Monadic Linear Logic -- Non-commutativity and MELL in the Calculus of Structures -- Quadratic Correctness Criterion for Non-commutative Logic -- Descriptive Complexity -- Capture Complexity by Partition -- An Existential Locality Theorem -- Actual Arithmetic and Feasibility -- The Natural Order-Generic Collapse for ?-Representable Databases over the Rational and the Real Ordered Group -- Semantics -- An Algebraic Foundation for Higraphs -- Semantic Characterisations of Second-Order Computability over the Real Numbers -- An Abstract Look at Realizability -- The Anatomy of Innocence -- Higher-Order Programs -- An Improved Extensionality Criterion for Higher-Order Logic Programs -- A Logic for Abstract State Machines -- Constrained Hyper Tableaux -- Modal Logics -- Modal Logic and the Two-Variable Fragment -- A Logic for Approximate First-Order Reasoning -- Inflationary Fixed Points in Modal Logic -- Categorical and Kripke Semantics for Constructive S4 Modal Logic -- Verification -- Labelled Natural Deduction for Interval Logics -- Decidable Navigation Logics for Object Structures -- The Decidability of Model Checking Mobile Ambients -- Automata -- A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem -- An Effective Extension of the Wagner Hierarchy to Blind Counter Automata -- Decision Procedure for an Extension of WS1S -- Lambda-Calculus -- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic -- Intersection Logic -- Life without the Terminal Type -- Fully Complete Minimal PER Models for the Simply Typed?-Calculus -- Induction -- A Principle of Induction -- On a Generalisation of Herbrand s Theorem -- Well-Founded Recursive Relations -- Equational Calculus -- Stratified Context Unification Is in PSPACE -- Uniform Derivation of Decision Procedures by Superposition -- Complete Categorical Equational Deduction -- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories -- Constructive Theory of Types -- Normalized Types -- Markov s Principle for Propositional Type Theory -- Recursion for Higher-Order Encodings -- Monotone Inductive and Coinductive Constructors of Rank 2. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Logique informatique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Fribourg, Laurent, |d 1957-...., |c informaticien. |4 pbd | |
| 710 | 2 | |a European Association for Computer Science Logic. |b Conference |n (10 |d :2001 |c :Paris). |4 aut | |
| 776 | 0 | |0 058531017 |t Computer science logic |o 15th international workshop, CSL 2001, 10th annual conference of the EACSL, Paris, France, September 10-13, 2001 |o proceedings |f Laurent Fribourg (ed.) |d 2001 |c Berlin |n Springer |p 1 vol. (XII-614 p.) |s Lecture notes in computer science |z 3-540-42554-3 | |
| 776 | 0 | |t Computer Science Logic |b Texte imprimé |z 9783662204290 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-44802-0 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-F380D2TV-2 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748062513 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44802-0 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751514160 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44802-0 |z Accès INSA CVL | |
| 997 | |0 948628 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||