Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with model-theory
Search options not deleted
user 111848
Model theory is the branch of mathematical logic which deals with the connection between a formal language and its interpretations, or models.
3
votes
0
answers
178
views
How to show that the set of universal sentences with infinite models is a decidable set?
I was looking for an example for a a non- complete set of formulas (not finite) that might be decidable and I found the following statement:
Given a recursive language $L$ the set $\{ \phi \ | \ \phi …
