E-Books durchsuchen
Logical Foundations of Computer Science [2007]
- 1
-
Justified and Common Knowledge: Limited Conservativity
- 12
-
The Intensional Lambda Calculus
- 26
-
Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers
- 41
-
Elementary Differential Calculus on Discrete and Hybrid Structures
- 54
-
Weighted Distributed Systems and Their Logics
- 69
-
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
- 84
-
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
- 100
-
Reasoning About Sequences of Memory States
- 115
-
Cut Elimination in Deduction Modulo by Abstract Completion
- 132
-
Density Elimination and Rational Completeness for First-Order Logics
- 147
-
Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus
- 162
-
Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics
- 180
-
A Decidable Temporal Logic of Repeating Values
- 195
-
Model Checking Knowledge and Linear Time: PSPACE Cases
- 212
-
Realizations and <Emphasis FontCategory="SansSerif">LP</Emphasis>
- 224
-
Successive Abstractions of Hybrid Automata for Monotonic <Emphasis FontCategory="SansSerif">CTL</Emphasis> Model Checking
- 241
-
Explicit Proofs in Formal Provability Logic
- 254
-
A Synthesis Algorithm for Hybrid Systems
- 269
-
Including the Past in ‘Topologic’
- 284
-
A Note on Rewriting Proofs and Fibonacci Numbers
- 293
-
On Complexity of Ehrenfeucht-Fraïssé Games
- 310
-
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
- 318
-
Hypersequent Calculus for Intuitionistic Logic with Classical Atoms
- 332
-
Proof Identity for Classical Logic: Generalizing to Normality
- 349
-
On the Constructive Dedekind Reals: Extended Abstract
- 363
-
Verifying Balanced Trees
- 379
-
Compactness Properties for Stable Semantics of Logic Programs
- 401
-
Uniform Circuits, & Boolean Proof Nets
- 422
-
Finite Automata Presentable Abelian Groups
- 437
-
Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic
- 449
-
Some Puzzles About Probability and Probabilistic Conditionals
- 457
-
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
- 472
-
Multiplexor Categories and Models of Soft Linear Logic
- 486
-
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
- 498
-
Total Public Announcements