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 withdefinitions.- 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.
| Erscheint lt. Verlag | 8.6.1994 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XI, 397 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 216 x 279 mm |
| Gewicht | 1 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Schlagworte | Algorithm analysis and problem complexity • Complexity • Hardcover, Softcover / Informatik, EDV/Informatik • Informatik • Lambda Calculi • Lambda-Kalküle • Logic • Logical Foundations • Logische Grundlagen • Mathematical Logics • Mathematische Logik • Nicht-klassische Logiken • Non-Classical Logics • problem complexity • Problemkomplexität |
| ISBN-13 | 9783540581406 / 9783540581406 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
