Logical Foundations of Computer Science [[electronic resource] ] : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings / / edited by Sergei Adian, Anil Nerode |
Edizione | [1st ed. 1997.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
Descrizione fisica | 1 online resource (IX, 436 p.) |
Disciplina | 004/.01/5113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Mathematical logic Computer logic Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
ISBN | 3-540-69065-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Topological semantics for hybrid systems -- Domain-free pure type systems -- Generic queries over quasi-o-minimal domains -- Towards computing distances between programs via Scott domains -- A safe recursion scheme for exponential time -- Finite model theory, universal algebra and graph grammars -- Complexity of query answering in logic databases with complex values -- Recognition of deductive data base stability -- The concurrency complexity for the Horn fragment of linear logic -- Studying algorithmic problems for free semi-groups and groups -- Learning small programs with additional information -- Cut elimination for the second order propositional logic with Hilbert's ?-symbol, extensionality, and full comprehension -- Finite bases of admissible rules for the logic S52 C -- An algebraic correctness criterion for intuitionistic proof-nets -- Towards a theory of recursive structures -- On the complexity of prefix formulas in modal logic of subset spaces -- The undecidability of second order linear affine logic -- Operational logic of proofs with functionality condition on proof predicate -- On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets -- Functions for the general solution of parametric word equations -- A proof procedure for hereditary Harrop formulas with free equality -- Basic forward chaining construction for logic programs -- Decidability and undecidability of the halting problem on Turing machines, a survey -- Case study: Additive linear logic and lattices -- Some decision problems for traces -- Existential instantiation and strong normalization -- Models for the logic of proofs -- Interpretation of the full computation tree logic CTL* on sets of infinite sequences -- Type introduction for equational rewriting -- Capturing bisimulation-invariant Ptime -- Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic -- A decidable fragment of second order linear logic -- Some results on Propositional Dynamic Logic with fixed points -- Quasi-characteristic inference rules for modal logics -- Provability logic with operations on proofs -- Formal verification of logic programs: Foundations and implementation -- Unification of terms with term-indexed variables -- Back-forth equivalences for design of concurrent systems -- Association nets: An alternative formalization of common thinking -- Simulating ?-expansions with ?-reductions in the second-order polymorphic ?-rcalculus -- Logical schemes for first order theories -- Verification of PLTL formulae by means of monotone disjunctive normal forms. |
Record Nr. | UNINA-9910144921603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Logical Foundations of Computer Science [[electronic resource] ] : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings / / edited by Sergei Adian, Anil Nerode |
Edizione | [1st ed. 1997.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
Descrizione fisica | 1 online resource (IX, 436 p.) |
Disciplina | 004/.01/5113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Mathematical logic Computer logic Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
ISBN | 3-540-69065-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Topological semantics for hybrid systems -- Domain-free pure type systems -- Generic queries over quasi-o-minimal domains -- Towards computing distances between programs via Scott domains -- A safe recursion scheme for exponential time -- Finite model theory, universal algebra and graph grammars -- Complexity of query answering in logic databases with complex values -- Recognition of deductive data base stability -- The concurrency complexity for the Horn fragment of linear logic -- Studying algorithmic problems for free semi-groups and groups -- Learning small programs with additional information -- Cut elimination for the second order propositional logic with Hilbert's ?-symbol, extensionality, and full comprehension -- Finite bases of admissible rules for the logic S52 C -- An algebraic correctness criterion for intuitionistic proof-nets -- Towards a theory of recursive structures -- On the complexity of prefix formulas in modal logic of subset spaces -- The undecidability of second order linear affine logic -- Operational logic of proofs with functionality condition on proof predicate -- On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets -- Functions for the general solution of parametric word equations -- A proof procedure for hereditary Harrop formulas with free equality -- Basic forward chaining construction for logic programs -- Decidability and undecidability of the halting problem on Turing machines, a survey -- Case study: Additive linear logic and lattices -- Some decision problems for traces -- Existential instantiation and strong normalization -- Models for the logic of proofs -- Interpretation of the full computation tree logic CTL* on sets of infinite sequences -- Type introduction for equational rewriting -- Capturing bisimulation-invariant Ptime -- Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic -- A decidable fragment of second order linear logic -- Some results on Propositional Dynamic Logic with fixed points -- Quasi-characteristic inference rules for modal logics -- Provability logic with operations on proofs -- Formal verification of logic programs: Foundations and implementation -- Unification of terms with term-indexed variables -- Back-forth equivalences for design of concurrent systems -- Association nets: An alternative formalization of common thinking -- Simulating ?-expansions with ?-reductions in the second-order polymorphic ?-rcalculus -- Logical schemes for first order theories -- Verification of PLTL formulae by means of monotone disjunctive normal forms. |
Record Nr. | UNISA-996465377903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logical Foundations of Computer Science [[electronic resource] ] : Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings / / edited by Anil Nerode, Yu.V. Matiyasevich |
Edizione | [1st ed. 1994.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
Descrizione fisica | 1 online resource (XI, 397 p.) |
Disciplina | 004/.01/5113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Mathematical logic Computer logic Algorithms Theory of Computation Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Algorithm Analysis and Problem Complexity |
ISBN | 3-540-48442-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNISA-996466269303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logical foundations of computer science--Tver '92 : second international symposium, Tver, Russia, July 20-24, 1992 proceedings / / A. Nerode, M. Taitslin (eds.) |
Pubbl/distr/stampa | Springer Berlin Heidelberg |
Disciplina | 004 |
Altri autori (Persone) |
NerodeAnil
TaitslinMikhail A |
Soggetto topico |
Computers - Congresses
Electronic data processing - Congresses Logic, Symbolic and mathematical - Congresses |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465772503316 |
Springer Berlin Heidelberg | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|