Vor Ort
Merkzettel Warenkorb
  • Produktbild: Logical Foundations of Computer Science
  • Produktbild: Logical Foundations of Computer Science
Band 813

Logical Foundations of Computer Science Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.06.1994

Herausgeber

Anil Nerode + weitere

Verlag

Springer Berlin

Seitenzahl

397

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

1 g

Auflage

1994

Sprache

Englisch

ISBN

978-3-540-58140-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.06.1994

Herausgeber

Verlag

Springer Berlin

Seitenzahl

397

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

1 g

Auflage

1994

Sprache

Englisch

ISBN

978-3-540-58140-6

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

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
  • Produktbild: Logical Foundations of Computer Science
  • Lower bounds for probabilistic space complexity: Communication-automata approach.- On model checking infinite-state systems.- Concurrency problem for Horn fragment of Girard's Linear Logic.- Referential data structures and labeled modal logic.- Yet another correctness criterion for Multiplicative Linear Logic with MIX.- An approach to effective model-checking of real-time Finite-State Machines in mu-calculus.- Allegories of circuits.- The complexity of propositional modal theories and the complexity of consistency of propositional modal theories.- Multiplicative Linear Logic for resource transformation nets.- The parameterized complexity of some problems in logic and linguistics.- Foundations of proof search strategies design in linear logic.- On extreme points of convex compact turing located set.- Application of typed lambda calculi in the untyped lambda calculus.- Classes with pairwise equivalent enumerations.- Strong normalization in a non-deterministic typed lambda-calculus.- On expressive completeness of modal logic.- Comparing models of the non-extensional typed ?-calculus extended abstract.- Coalgebras and approximation.- Computational and concurrency models of linear logic.- The longest perpetual reductions in Orthogonal Expression Reduction Systems.- The notion of rank and games.- A predicate logic of well-founded actions.- Predicative recurrence in finite types.- Arity vs. alternation in second order logic.- Hereditarily sequential functionals.- Propositional linear temporal logic and language homomorphisms.- An abstract property of confluence applied to the study of the lazy partial lambda calculus.- On specialization of derivations in axiomatic equality theories.- Preserving of admissible inference rules in modal logic.- Pure Type Systems with definitions.- Craig interpolation property in modal logics with provability interpretation.- Representing null values in logic programming.- Comparing cubes.- A logic of capabilities.- Weak orthogonality implies confluence: The higher-order case.