Difference between revisions of "User:IssaRice/Computability and logic/List of possibilities for completeness and decidability"

From Machinelearning
Jump to: navigation, search
(Created page with "{| class="sortable wikitable" |- ! Decidable logic? !! Complete logic? (semantic completeness) !! Decidable theory? !! Complete theory? (negation-completeness) !! Example or p...")
 
Line 25: Line 25:
 
| No || Yes || No || Yes ||
 
| No || Yes || No || Yes ||
 
|-
 
|-
| No || Yes || No || No ||
+
| No || Yes || No || No || The theory of Robinson arithmetic inside first-order logic
 
|-
 
|-
 
| No || No || Yes || Yes ||
 
| No || No || Yes || Yes ||

Revision as of 19:39, 20 February 2019

Decidable logic? Complete logic? (semantic completeness) Decidable theory? Complete theory? (negation-completeness) Example or proof of non-existence
Yes Yes Yes Yes
Yes Yes Yes No
Yes Yes No Yes
Yes Yes No No
Yes No Yes Yes
Yes No Yes No
Yes No No Yes
Yes No No No
No Yes Yes Yes
No Yes Yes No
No Yes No Yes
No Yes No No The theory of Robinson arithmetic inside first-order logic
No No Yes Yes
No No Yes No
No No No Yes
No No No No