OurBigBook About$ Donate
 Sign in Sign up

Scott sentence (σM​)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Mathematical logic Infinitary language Countable infinitary logic
2026-10-06  0 By others on same topic  0 Discussions Create my own version
A Scott sentence for a countable structure is a sentence of countable infinitary logic satisfied, among countable structures in the same first-order language, exactly by its isomorphic copies. It may also have uncountable models. Scott formulas and stabilized back-and-forth method equivalences give its construction.

 Ancestors (7)

  1. Countable infinitary logic
  2. Infinitary language
  3. Mathematical logic
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Countable infinitary logic
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 21 / 3 / Solution
  • Scott isomorphism theorem

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook