UB Paderborn / Katalog / Suche / in CDI

Logical Foundations of Computer Science — Tver '92: Second International Symposium Tver, Russia, July 20–24, 1992 Proceedings

1992

Volltextzugriff (PDF)

Logic at Botik '89: Symposium on Logical Foundations of Computer Science Pereslavl-Zalessky, USSR, July 3–8, 1989 Proceedings

1989

Volltextzugriff (PDF)

Collapse results for query languages in database theory

Russian mathematical surveys, 2006-04, Vol.61 (2), p.195-253, Article 195

2006

Volltextzugriff (PDF)

Comparison of expressive power of some query languages for databases

Proceedings of the Steklov Institute of Mathematics, 2011-10, Vol.274 (1), p.273-288

Taitslin, M. A.

2011

Volltextzugriff (PDF)

Graded modalities in epistemic logic

Logical Foundations of Computer Science — Tver '92, 2005, p.503-514

2005

Volltextzugriff (PDF)

An interleaving model for real-time systems

Logical Foundations of Computer Science — Tver '92, 2005, p.81-86

2005

Volltextzugriff (PDF)

A unifying theory of dependent types: the schematic approach

Logical Foundations of Computer Science — Tver '92, 2005, p.293-304

2005

Volltextzugriff (PDF)

Strictness logic and polymorphic invariance

Logical Foundations of Computer Science — Tver '92, 2005, p.33-44

2005

Volltextzugriff (PDF)

Quantifying the amount of verboseness (extended abstract)

Logical Foundations of Computer Science — Tver '92, 2005, p.21-32

2005

Volltextzugriff (PDF)

Correctness of generic modules

Logical Foundations of Computer Science — Tver '92, 2005, p.406-417

2005

Volltextzugriff (PDF)

Ordinal arithmetic with list structures (preliminary version)

Logical Foundations of Computer Science — Tver '92, 2005, p.117-138

2005

Volltextzugriff (PDF)

The Ehrenfeucht-Fraïssé games for transitive closure

Logical Foundations of Computer Science — Tver '92, 2005, p.57-68

2005

Volltextzugriff (PDF)

Automated deduction in additive and multiplicative linear logic

Logical Foundations of Computer Science — Tver '92, 2005, p.151-162

2005

Volltextzugriff (PDF)

A constructive proof that tree are well-quasi-ordered under minors (detailed abstract)

Logical Foundations of Computer Science — Tver '92, 2005, p.174-185

2005

Volltextzugriff (PDF)

Feasibility of finite and infinite paths in data dependent programs

Logical Foundations of Computer Science — Tver '92, 2005, p.69-80

2005

Volltextzugriff (PDF)

Gentzen-style and Novikov-style cut-elimination

Logical Foundations of Computer Science — Tver '92, 2005, p.493-502

2005

Volltextzugriff (PDF)

Balanced formulas, BCK-minimal formulas and their proofs

Logical Foundations of Computer Science — Tver '92, 2005, p.198-208

2005

Volltextzugriff (PDF)

Complete sequential calculi for the first order symmetrical linear temporal logic with until and since

Logical Foundations of Computer Science — Tver '92, 2005, p.382-393

2005

Volltextzugriff (PDF)

A sequent calculus for a first order linear temporal logic with equality

Logical Foundations of Computer Science — Tver '92, 2005, p.430-440

2005

Volltextzugriff (PDF)

Machine learning of higher order programs

Logical Foundations of Computer Science — Tver '92, 2005, p.9-20

2005

Volltextzugriff (PDF)

Effective operators and continuity revisited

Logical Foundations of Computer Science — Tver '92, 2005, p.459-469

2005

Volltextzugriff (PDF)

Logical characterizations of bounded query classes I: Logspace oracle machines

Logical Foundations of Computer Science — Tver '92, 2005, p.470-479

2005

Volltextzugriff (PDF)

Preference logics and nonmonotonicity in logic programming

Logical Foundations of Computer Science — Tver '92, 2005, p.45-56

2005

Volltextzugriff (PDF)

Propositional dynamic logic with fixed points: Algorithmic tools for verification of finite state machines

Logical Foundations of Computer Science — Tver '92, 2005, p.452-458

2005

Volltextzugriff (PDF)

Banishing robust Turing completeness

Logical Foundations of Computer Science — Tver '92, 2005, p.186-197

2005

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Logical Foundations of Computer Science — Tver '92: Second International Symposium Tver, Russia, July 20–24, 1992 Proceedings

Logic at Botik '89: Symposium on Logical Foundations of Computer Science Pereslavl-Zalessky, USSR, July 3–8, 1989 Proceedings

Collapse results for query languages in database theory

Comparison of expressive power of some query languages for databases

Graded modalities in epistemic logic

An interleaving model for real-time systems

A unifying theory of dependent types: the schematic approach

Strictness logic and polymorphic invariance

Quantifying the amount of verboseness (extended abstract)

Correctness of generic modules

Ordinal arithmetic with list structures (preliminary version)

The Ehrenfeucht-Fraïssé games for transitive closure

Automated deduction in additive and multiplicative linear logic

A constructive proof that tree are well-quasi-ordered under minors (detailed abstract)

Feasibility of finite and infinite paths in data dependent programs

Gentzen-style and Novikov-style cut-elimination

Balanced formulas, BCK-minimal formulas and their proofs

Complete sequential calculi for the first order symmetrical linear temporal logic with until and since

A sequent calculus for a first order linear temporal logic with equality

Machine learning of higher order programs

Effective operators and continuity revisited

Logical characterizations of bounded query classes I: Logspace oracle machines

Preference logics and nonmonotonicity in logic programming

Propositional dynamic logic with fixed points: Algorithmic tools for verification of finite state machines

Banishing robust Turing completeness

Suchergebnisse filtern