Pages that link to "Item:Q5271034"
From MaRDI portal
The following pages link to 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Q5271034):
Displaying 50 items.
- Duality in Logic and Computation (Q5271035) (← links)
- Regular Functions and Cost Register Automata (Q5271036) (← links)
- Presburger Vector Addition Systems (Q5271037) (← links)
- Reasoning about Data Repetitions with Counter Systems (Q5271038) (← links)
- On the Context-Freeness Problem for Vector Addition Systems (Q5271039) (← links)
- Groupoids, Hypergraphs, and Symmetries in Finite Models (Q5271040) (← links)
- An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (Q5271041) (← links)
- Two-Variable Logic with Counting and Trees (Q5271042) (← links)
- Measurable Spaces and Their Effect Logic (Q5271043) (← links)
- Topological Structure of Quantum Algorithms (Q5271044) (← links)
- On the Query Complexity of Real Functionals (Q5271045) (← links)
- Quantitative Monadic Second-Order Logic (Q5271046) (← links)
- Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (Q5271047) (← links)
- Quantitative Reasoning for Proving Lock-Freedom (Q5271049) (← links)
- Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (Q5271050) (← links)
- Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL (Q5271051) (← links)
- Model-Checking Parse Trees (Q5271052) (← links)
- The Complexity of Model Checking Multi-stack Systems (Q5271053) (← links)
- Maximum Matching and Linear Programming in Fixed-Point Logic with Counting (Q5271054) (← links)
- Turing Machines with Atoms (Q5271055) (← links)
- Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (Q5271056) (← links)
- Decidability of Weak Simulation on One-Counter Nets (Q5271057) (← links)
- Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes (Q5271058) (← links)
- Calculating the Fundamental Group of the Circle in Homotopy Type Theory (Q5271059) (← links)
- Type-Based Productivity of Stream Definitions in the Calculus of Constructions (Q5271060) (← links)
- Fibred Data Types (Q5271061) (← links)
- Arbitrary Action Model Logic and Action Model Synthesis (Q5271062) (← links)
- On the Boundary of Behavioral Strategies (Q5271063) (← links)
- A Relatively Complete Generic Hoare Logic for Order-Enriched Effects (Q5271064) (← links)
- Unifying Classical and Intuitionistic Logics for Computational Control (Q5271065) (← links)
- The Cost of Usage in the ?-Calculus (Q5271066) (← links)
- Weighted Relational Models of Typed Lambda-Calculi (Q5271067) (← links)
- Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing (Q5271068) (← links)
- Stone Duality for Markov Processes (Q5271069) (← links)
- Trading Performance for Stability in Markov Decision Processes (Q5271070) (← links)
- Solving Partial-Information Stochastic Parity Games (Q5271071) (← links)
- Expressive Completeness for Metric Temporal Logic (Q5271072) (← links)
- One-Path Reachability Logic (Q5271073) (← links)
- Substructure Temporal Logic (Q5271074) (← links)
- Name-Passing Calculi: From Fusions to Preorders and Types (Q5271075) (← links)
- A Compositional Semantics for the Reversible p-Calculus (Q5271076) (← links)
- Pumping by Typing (Q5271077) (← links)
- From Frame Properties to Hypersequent Rules in Modal Logics (Q5271078) (← links)
- The Logic of Exact Covers: Completeness and Uniform Interpolation (Q5271079) (← links)
- Compressing Polarized Boxes (Q5271080) (← links)
- Kripke Semantics for Modal Bilattice Logic (Q5271081) (← links)
- Forcing MSO on Infinite Words in Weak MSO (Q5271082) (← links)
- From Monadic Second-Order Definable String Transformations to Transducers (Q5271083) (← links)
- From Two-Way to One-Way Finite State Transducers (Q5271084) (← links)
- A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus (Q5271085) (← links)