Amanote Research

Amanote Research

    RegisterSign 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
MathematicsApplied 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 ScienceTheoretical Computer Science
2004English

Mortality of Iterated Piecewise Affine Functions Over the Integers: Decidability and Complexity

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2015English

Decidability of Conversion for Type Theory in Type Theory

Proceedings of the ACM on Programming Languages
2018English

Decidability of Irreducible Tree Shifts of Finite Type

Journal of Statistical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
2019English

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

2018English

Decidability and Syntactic Control of Interference

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

Decidability and Undecidability of Marked PCP

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Continuous Petri Nets: Expressive Power and Decidability Issues

International Journal of Foundations of Computer Science
Computer Science
2010English

On the Decidability of FDNC Programs

Intelligenza Artificiale
Artificial Intelligence
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy