Amanote Research
Register
Sign In
Type Structure Complexity and Decidability
Transactions of the American Mathematical Society
- United States
doi 10.2307/1998751
Full Text
Open PDF
Abstract
Available in
full text
Categories
Mathematics
Applied Mathematics
Date
May 1, 1982
Authors
T. S. Millar
Publisher
JSTOR
Related search
Decidability and Complexity in Automatic Monoids
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Mortality of Iterated Piecewise Affine Functions Over the Integers: Decidability and Complexity
Computability
Theoretical Computer Science
Computational Theory
Computer Science Applications
Artificial Intelligence
Mathematics
Decidability of Conversion for Type Theory in Type Theory
Proceedings of the ACM on Programming Languages
Decidability of Irreducible Tree Shifts of Finite Type
Journal of Statistical Physics
Nonlinear Physics
Mathematical Physics
Statistical
Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq
Decidability and Syntactic Control of Interference
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Decidability and Undecidability of Marked PCP
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Kähler Moduli Stabilization and the Propagation of Decidability
Physical Review D
Astronomy
Physics
Soundness of Workflow Nets: Classification, Decidability, and Analysis
Formal Aspects of Computing
Theoretical Computer Science
Software