Skip to main content

Questions tagged [decidable]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
-1 votes
1 answer

Implementability of proof assistants for Infinitary logics with finite many terms

Infinitary logic is a natural consequence of extending the length of proofs of first-order logic to a infinite ordinal level. By definition, since proof lengths are infinitely long, one should not ...
Ember Edison's user avatar