Definable
(Redirected from Combinatorial definability)
Look up definable in Wiktionary, the free dictionary.
In mathematical logic, the word definable may refer to:
- A definable real number
- A definable set
- A definable integer sequence
- A relation or function definable over a first order structure
- A mathematical object or concept that is well-defined
This disambiguation page lists articles associated with the title Definable.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.