Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq

doi 10.1145/3176245.3167088
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Decidability of Conversion for Type Theory in Type Theory

Proceedings of the ACM on Programming Languages
2018English

C2PDLS: A Combination of Combinatory and Converse PDL With Substitutions

English

Completeness and Decidability Results for First-Order Clauses With Indices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

A Constructive Denotational Semantics for Kahn Networks in Coq

English

The Type Theoretic Interpretation of Constructive Set Theory: Inductive Definitions

Logic, Methodology and Philosophy of Science VII, Proceedings of the Seventh International Congress of Logic, Methodology and Philosophy of Science
1986English

And-Or Tableaux for Fixpoint Logics With Converse: LTL, CTL, PDL and CPDL

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Type Structure Complexity and Decidability

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Decidability of Irreducible Tree Shifts of Finite Type

Journal of Statistical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
2019English

Decidability and Definability Results Related to the Elementary Theory of Ordinal Multiplication

Fundamenta Mathematicae
Number TheoryAlgebra
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy