S2CID 798307. Retrieved 5 August 2014. Mathoverflow.net/Decidability-of-chess-on-an-infinite-board Decidability-of-chess-on-an-infinite-board Brumleve, Dan; Hamkins...
16 KB (1,887 words) - 21:01, 15 May 2025
Look up decidability in Wiktionary, the free dictionary. The word decidable may refer to: Decidable language Decidability (logic) for the equivalent in...
552 bytes (95 words) - 15:04, 6 November 2022
Computable set (redirect from Decidable set)
total computable function, or the empty set. Computably enumerable Decidability (logic) Recursively enumerable language Recursive language Recursion That...
4 KB (500 words) - 18:15, 17 May 2025
Decision problem (redirect from Decidability problems)
Computational problem Counting problem (complexity) Decidability (logic) – for the problem of deciding whether a formula is a consequence of a logical theory...
10 KB (1,246 words) - 09:36, 19 May 2025
EXPSPACE-hard, although decidability itself has had the status of a longstanding open problem. In 2015, a proof of decidability was published in the journal...
34 KB (2,952 words) - 06:21, 20 May 2025
statement, it cannot be proven by a mathematical proof.[citation needed] Decidability (logic) Decision problem Effective results in number theory Function problem...
4 KB (492 words) - 11:57, 12 May 2025
the metatheory of logic. Completeness (logic) Syntax (logic) Consistency Decidability (logic) Deductive system Interpretation (logic) Cantor's theorem...
25 KB (2,119 words) - 22:15, 10 April 2025
connectives in various logics; decidability and complexity aspects are generally omitted though. Video of Graham Priest & Maureen Eckert on Deviant Logic...
10 KB (1,144 words) - 11:29, 6 February 2025
Recursive language (redirect from Turing-decidable language)
algorithms. The concept of decidability may be extended to other models of computation. For example, one may speak of languages decidable on a non-deterministic...
6 KB (745 words) - 19:01, 9 May 2025
to be undecidable from T. (This concept is unrelated to the idea of "decidability" as in a decision problem.) A theory T is independent if no axiom in...
5 KB (519 words) - 05:55, 20 August 2024
Alfred Tarski: Life and Logic (Cambridge: Cambridge University Press, 2008). Macintyre, A.J.; Wilkie, A.J. (1995), "On the decidability of the real exponential...
4 KB (496 words) - 23:15, 25 April 2024
cardinal Unfoldable cardinal Entscheidungsproblem Decision problem Decidability (logic) Church–Turing thesis Computable function Algorithm Recursion Primitive...
14 KB (1,012 words) - 00:08, 16 November 2024
In logic and formal semantics, term logic, also known as traditional logic, syllogistic logic or Aristotelian logic, is a loose name for an approach to...
29 KB (3,903 words) - 08:52, 6 April 2025
Undecidable problem (redirect from Semi-decidable)
whose learnability in EMX is undecidable in standard set theory. Decidability (logic) Entscheidungsproblem Proof of impossibility Unknowability Wicked...
14 KB (1,921 words) - 21:06, 21 February 2025
-- Dagfinn Føllesdal -- De Interpretatione -- De Morgan's laws -- Decidability (logic) -- Decidophobia -- Decision making -- Decisional balance sheet --...
20 KB (1,851 words) - 22:57, 29 March 2025
In the mathematical study of logic and the physical analysis of quantum foundations, quantum logic is a set of rules for manipulation of propositions...
35 KB (4,045 words) - 00:33, 19 April 2025
Fuzzy logic is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1. It is employed to handle the concept...
54 KB (6,598 words) - 13:29, 27 March 2025
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical...
145 KB (16,460 words) - 09:25, 16 May 2025
Admissible rule (category Modal logic)
{\displaystyle \vdash _{L}} and R. Notice that decidability of admissible rules of a decidable logic is equivalent to the existence of recursive (or...
29 KB (4,821 words) - 17:09, 6 March 2025
Metalogic (redirect from Meta-logic)
truth-functional propositional logic (Emil Post 1920) Proof of the decidability of truth-functional propositional logic (Emil Post 1920) Proof of the consistency...
11 KB (1,402 words) - 20:44, 10 April 2025
Satisfiability (redirect from Satisfiability (logics))
In mathematical logic, a formula is satisfiable if it is true under some assignment of values to its variables. For example, the formula x + 3 = y {\displaystyle...
12 KB (1,500 words) - 18:45, 26 November 2022
Theory of pure equality (category Mathematical logic stubs)
first-order logic, all valid formulas are provable using axioms of first-order logic and the equality axioms (see also equational logic). Decidability can be...
6 KB (761 words) - 12:02, 24 October 2024
First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics,...
92 KB (12,931 words) - 16:12, 7 May 2025
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory...
69 KB (8,370 words) - 19:50, 19 April 2025
two-variable logic, such as satisfiability and finite satisfiability, are decidable. This result generalizes results about the decidability of fragments...
3 KB (384 words) - 13:07, 13 September 2022
comprehension axiom. Likewise, the logic formed the basis of a decidable sub-theory of predicate logic, called 'Direct logic' (Ketonen & Wehrauch, 1984; Ketonen...
3 KB (328 words) - 05:13, 14 January 2025
In logic, a three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems...
32 KB (3,292 words) - 21:12, 5 May 2025
Rule of inference (redirect from Laws of Logic)
of deriving conclusions from premises. They are integral parts of formal logic, serving as norms of the logical structure of valid arguments. If an argument...
66 KB (7,292 words) - 09:00, 19 April 2025
expressive than first-order logic. In contrast to the latter, the core reasoning problems for DLs are (usually) decidable, and efficient decision procedures...
39 KB (4,305 words) - 13:10, 2 April 2025
In mathematical logic, various sublanguages of set theory are decidable. These include: Sets with monotone, additive, and multiplicative Functions. Sets...
1 KB (133 words) - 01:23, 4 March 2025