decidability

  "We are lacking canons of decidability on that issue."

Willy Takes the Night Train to Heaven

We are forced to conclude that, under the very natural decidability interpretation of P

Constructive Mathematics

Scott established the completeness and decidability of various axiomatic tense logics.

The Sun Is Not

However, in contrast to the concepts of ordinary logic, this system is extended by the concept of “simultaneous decidability” which is characteristic for quantum mechanics [1932, p. 253].

Puppet X: 1

"We are lacking canons of decidability on that issue."

Willy Takes the Night Train to Heaven

The elimination of quantifiers became a main method in mathematical logic to prove decidability, and proving decidability was stated as the main problem of mathematical logic in Hilbert and Ackermann

The Algebra of Logic Tradition

The study of Boolean algebras has several aspects: structure theory, model theory of Boolean algebras, decidability and undecidability questions for the class of Boolean algebras, and the indicated applications.

The Mathematics of Boolean Algebra

“Some decidability results on grammatical inference and complexity”, Information and Control, 20:

Innateness and Language

In this way, decidability of some substructural logics is assured.

Substructural Logics

The theorem is the typed equivalent of the decidability of the implicational fragment of the logic of relevant implication.

Combinatory Logic