If a language is Turing decidable, does that make the sublanguages also Turing decidable
69740
Is the following statement true ? If $L$ is a decidable language and $L' \subseteq \; L$, then $L'$ is also decidable ? Prove your answer is correct
46430
A simple decision problem whose decidability is not known
118617
Completeness and Incompleteness
64726
Is it possible to type hint more than one type?
106211
Is the universe isomorphic to a universal turing machine?
74839
Catalan numbers: bijection between applications of a binary operator and Dyck words.
111349
Finite automaton that recognizes the empty language $\emptyset$
114931
Extend a language with additional keywords?
21254
Formal language: Proving the reverse operation on a word through induction
109470
Proof of whether a specific element is in a commutative, invertible monoid.
140682
Proving a property of a Logic Formal Language
151994
Why do first order languages have at most countably many symbols?
50099
Example of incomplete, but decidable theory, and of complete and undecidable theory, question
139170
Syntactic characterisation of the intersection of CTL and LTL
105545
Confused about language and words in logic
81696
Does appending a question mark to a declarative sentence result in a valid sentence?
74455
Can a single sentence be used to distinguish between isomorphic classes of finite structures?