Geschäftskunden Kundenprogramme

KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Logical Foundations of Computer Science - Tver '92
  • Produktbild: Logical Foundations of Computer Science - Tver '92
Band 620

Logical Foundations of Computer Science - Tver '92 Second International Symposium, Tver, Russia, July 20-24, 1992. Proceedings

Aus der Reihe Lecture Notes in Computer Science

Fr. 72.90

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

24.06.1992

Abbildungen

XI, 517 p.

Herausgeber

Anil Nerode + weitere

Verlag

Springer Berlin

Seitenzahl

517

Maße (L/B/H)

23.5/15.5/2.9 cm

Gewicht

791 g

Auflage

1992

Sprache

Englisch

ISBN

978-3-540-55707-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

24.06.1992

Abbildungen

XI, 517 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

517

Maße (L/B/H)

23.5/15.5/2.9 cm

Gewicht

791 g

Auflage

1992

Sprache

Englisch

ISBN

978-3-540-55707-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Logical Foundations of Computer Science - Tver '92
  • Produktbild: Logical Foundations of Computer Science - Tver '92
  • Modal Linear Logic.- Machine learning of higher order programs.- Quantifying the amount of verboseness (extended abstract).- Strictness logic and polymorphic invariance.- Preference logics and nonmonotonicity in logic programming.- The Ehrenfeucht-Fraïssé games for transitive closure.- Feasibility of finite and infinite paths in data dependent programs.- An interleaving model for real-time systems.- Incremental evaluation of natural semantics specifications.- Denotations for classical proofs -Preliminary results-.- Ordinal arithmetic with list structures (preliminary version).- Many-valued non-monotonic modal logics.- Automated deduction in additive and multiplicative linear logic.- Intensionally stable functions.- A constructive proof that tree are well-quasi-ordered under minors (detailed abstract).- Banishing robust Turing completeness.- Balanced formulas, BCK-minimal formulas and their proofs.- Non-stable models of linear logic.- Ordering optimisations for concurrent logic programs.- A categorical interpretation of partial function logic and Hoare logic.- The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited.- Typed ?-calculus with recursive definitions.- Set theoretic foundations for fuzzy set theory, and their applications.- Constructive specifications of abstract data types using temporal logic.- An interval-based modal logic for system specification.- A unifying theory of dependent types: the schematic approach.- MSL — A Mathematical Specification Language.- Partial algebra + order-sorted algebra = galactic algebra.- Minimal negation and Hereditary Harrop formulae.- Kleene automata and recursion theory.- Incremental polymorphic type checking with update.- Operators on lattices of?-Herbrand interpretations.- Sequential calculus for proving the properties of regular programs.- Complete sequential calculi for the first order symmetrical linear temporal logic with until and since.- Non modularity and expressibility for nets of relations (extended abstract).- Correctness of generic modules.- An and-parallelism cooperative scheme for full prolog interpreters on a transputer-based architecture.- A sequent calculus for a first order linear temporal logic with equality.- On the expressive power of modal logics on trees.- Propositional dynamic logic with fixed points: Algorithmic tools for verification of finite state machines.- Effective operators and continuity revisited.- Logical characterizations of bounded query classes I: Logspace oracle machines.- Solving equational constraints in polymorphic types.- Gentzen-style and Novikov-style cut-elimination.- Graded modalities in epistemic logic.