Model theory

Lindström's Theorem

Equation form expr-041224a87d676034

ModL(L)(E)

Read as: the class of models in logic L over language L satisfying formula E

Means: This expression denotes the class of models in logic L over language L satisfying formula E. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-06ba21d50df1893a

MnE

Read as: structure M sub n satisfies formula E

Means: This expression denotes structure M sub n satisfies formula E. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-07e957df44a6a893

qp

Read as: q is a subset of p

Means: This expression denotes q is a subset of p. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-0c370aa793b02aac

Q

Read as: Q prime

Means: This expression denotes Q prime. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-0c5964563a68be62

c

Read as: sequence c

Means: This expression denotes sequence c. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-0ea1e3755dad0c75

D2

Read as: formula D sub two

Means: This expression denotes formula D sub two. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-0edf20f726f4680d

Mod(L)(E)=Mod(L)(D)

Read as: the class of models in logic L satisfying formula E equals the class of models in logic L satisfying formula D

Means: This expression denotes the class of models in logic L satisfying formula E equals the class of models in logic L satisfying formula D. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-11eddd97db8d14ba

NLE

Read as: structure N satisfies in logic L formula E

Means: This expression denotes structure N satisfies in logic L formula E. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-1336081d34027f81

L{P,Q}

Read as: language L union P comma Q

Means: This expression denotes language L union P comma Q. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-13bcf9d25c75255b

G

Read as: formula G

Means: This expression denotes formula G. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-1540c1218dfc9686

L,L

Read as: abstract logic L together with its satisfaction relation

Means: This expression denotes abstract logic L together with its satisfaction relation. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-16eaddd7733198ca

N*

Read as: structure N star

Means: This expression denotes structure N star. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-19f499db43548864

FL(L{R,c1,,cn})

Read as: formula F is in L open parenthesis language L union R comma c sub one comma and so on comma c sub n close parenthesis

Means: This expression denotes formula F is in L open parenthesis language L union R comma c sub one comma and so on comma c sub n close parenthesis. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-1a387be222bd462f

L,L

Read as: abstract logic L together with its satisfaction relation

Means: This expression denotes abstract logic L together with its satisfaction relation. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-1b16b1df538ba12d

n

Read as: n

Means: This expression denotes n. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-1bf62b2e6a844b50

I(a,b)

Read as: I open parenthesis sequence a comma sequence b close parenthesis

Means: This expression denotes I open parenthesis sequence a comma sequence b close parenthesis. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-1d237c90ea65cd24

N0LE

Read as: structure N sub zero does not satisfy in logic L formula E

Means: This expression denotes structure N sub zero does not satisfy in logic L formula E. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-20c747571b26cf2b

|N|={a|M|:RM(a,b1,,bn)}

Read as: the domain of structure N is the set of elements a in the domain of M for which relation R holds of a and parameters b sub one through b sub n

Means: This expression denotes the domain of structure N is the set of elements a in the domain of M for which relation R holds of a and parameters b sub one through b sub n. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-21bc9c309ea814fc

Mod(L)(E)

Read as: the class of models in logic L satisfying formula E

Means: This expression denotes the class of models in logic L satisfying formula E. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-27bb456fe64613ab

|Mn*|

Read as: the domain of structure M sub n star

Means: This expression denotes the domain of structure M sub n star. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-2ceb4df5993cba2b

c1

Read as: c sub one

Means: This expression denotes c sub one. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-2d711642b726b044

x

Read as: x

Means: This expression denotes x. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-2e7d2c03a9507ae2

c

Read as: c

Means: This expression denotes c. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-33a9c96304bcc292

|M|

Read as: the domain of structure M

Means: This expression denotes the domain of structure M. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-342e5ae4cc90bd9b

Mn

Read as: structure M sub n

Means: This expression denotes structure M sub n. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-343f3ea0d990abaf

MLF

Read as: structure M satisfies in logic L formula F

Means: This expression denotes structure M satisfies in logic L formula F. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-398cc09eb70bbcd2

EL(L)

Read as: formula E is in L open parenthesis language L close parenthesis

Means: This expression denotes formula E is in L open parenthesis language L close parenthesis. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-39e8d862f0ff3682

MN

Read as: structure M is isomorphic to structure N

Means: This expression denotes structure M is isomorphic to structure N. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-3d8968823571b2dd

L

Read as: the satisfaction relation for logic L

Means: This expression denotes the satisfaction relation for logic L. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-3f4c41b843227280

b1,

Read as: b sub one comma

Means: This expression denotes b sub one comma. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-428890bacf44ce4f

L

Read as: language L prime

Means: This expression denotes language L prime. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-42b8f19ae63d24a4

M

Read as: structure M

Means: This expression denotes structure M. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-4605a2de3f74e147

M0

Read as: structure M sub zero

Means: This expression denotes structure M sub zero. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-4727793a5a82f07c

a=a1,an

Read as: sequence a consists of a sub one through a sub n

Means: This expression denotes sequence a consists of a sub one through a sub n. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-475b56cd695e8364

pI

Read as: p belongs to the family I of partial isomorphisms

Means: This expression denotes p belongs to the family I of partial isomorphisms. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-4ac96c6d047aa8aa

L(L)

Read as: L open parenthesis language L close parenthesis

Means: This expression denotes L open parenthesis language L close parenthesis. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-4ae81572f06e1b88

Q

Read as: Q

Means: This expression denotes Q. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-4b68ab3847feda7d

X

Read as: X

Means: This expression denotes X. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-4d05672a6bd868b6

|N|

Read as: the domain of structure N

Means: This expression denotes the domain of structure N. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-4e2719493601b17f

J(n,a,b)

Read as: J open parenthesis n comma sequence a comma sequence b close parenthesis

Means: This expression denotes J open parenthesis n comma sequence a comma sequence b close parenthesis. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-51957fad06b1d95d

Mn*LE

Read as: structure M sub n star satisfies formula E in logic L

Means: This expression denotes structure M sub n star satisfies formula E in logic L. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-52274a3b7cb9d962

a,c|M|<ω

Read as: sequences a and c are finite sequences over the domain of structure M

Means: This expression denotes sequences a and c are finite sequences over the domain of structure M. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-5364480bb54d23f0

Nn

Read as: structure N sub n

Means: This expression denotes structure N sub n. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-558a77c65edfbe0c

bn

Read as: b sub n

Means: This expression denotes b sub n. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-568f9a89f7fd38f8

L1,L1L2,L2

Read as: abstract logic L sub two is at least as expressive as abstract logic L sub one

Means: This expression denotes abstract logic L sub two is at least as expressive as abstract logic L sub one. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-5713cebc55c46f9a

L=L{c}

Read as: language L' equals language L set minus c

Means: This expression denotes language L' equals language L set minus c. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-57885e4c75965b23

Γ

Read as: Gamma

Means: This expression denotes Gamma. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-58ec6f41c57dedff

L1,L1

Read as: abstract logic L sub one together with its satisfaction relation

Means: This expression denotes abstract logic L sub one together with its satisfaction relation. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-5afa20230f875253

n

Read as: n is in the natural numbers

Means: This expression denotes n is in the natural numbers. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-5b63a60fdb499c3a

N

Read as: structure N

Means: This expression denotes structure N. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-5c37345158ceafa2

c

Read as: c'

Means: This expression denotes c'. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-5c62e091b8c0565f

P

Read as: P

Means: This expression denotes P. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-5c958bf6fd5e2c8d

L2,L2L1,L1

Read as: abstract logic L sub one is at least as expressive as abstract logic L sub two

Means: This expression denotes abstract logic L sub one is at least as expressive as abstract logic L sub two. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-5ddb158cde8e2d0e

MpN

Read as: structure M is partially isomorphic to structure N

Means: This expression denotes structure M is partially isomorphic to structure N. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-5fadfbd4ca939840

E

Read as: formula E

Means: This expression denotes formula E. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-63456f179ad59ff8

|M|*

Read as: the domain of structure M star

Means: This expression denotes the domain of structure M star. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-6448f48fc5887d48

J(n*k,a,b)

Read as: relation J holds of n star minus k and sequences a and b

Means: This expression denotes relation J holds of n star minus k and sequences a and b. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-65fadd6de486ab5c

M[X,b1,,bn]LF if and only if NLE,

Read as: the expansion of structure M by X and b sub one through b sub n satisfies formula F in logic L if and only if structure N satisfies formula E in logic L

Means: This expression denotes the expansion of structure M by X and b sub one through b sub n satisfies formula F in logic L if and only if structure N satisfies formula E in logic L. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-6698cf14241bc1bf

Mn*pNn*

Read as: structure M sub n star is partially isomorphic to structure N sub n star

Means: This expression denotes structure M sub n star is partially isomorphic to structure N sub n star. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-68a9d5a8339e4038

cn

Read as: c sub n

Means: This expression denotes c sub n. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-68ceedec7f42fede

Nn*

Read as: structure N sub n star

Means: This expression denotes structure N sub n star. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-6a7c4ed376415ed1

MnLE

Read as: structure M sub n satisfies in logic L formula E

Means: This expression denotes structure M sub n satisfies in logic L formula E. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-6b0b0cce2607f0e0

DN

Read as: formula D sub structure N

Means: This expression denotes formula D sub structure N. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-6b96060b8f40f87b

|Nn*|

Read as: the domain of structure N sub n star

Means: This expression denotes the domain of structure N sub n star. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-6d0abed06b5f13ea

FL(L)

Read as: formula F is in L open parenthesis language L close parenthesis

Means: This expression denotes formula F is in L open parenthesis language L close parenthesis. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-6da3583735a2a7a0

T

Read as: T prime

Means: This expression denotes T prime. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-6da43b944e494e88

J

Read as: J

Means: This expression denotes J. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-6e8100b8f072619c

Nn*LE

Read as: structure N sub n star does not satisfy formula E in logic L

Means: This expression denotes structure N sub n star does not satisfy formula E in logic L. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-6ea00ba5eac9dc0b

L

Read as: language L prime

Means: This expression denotes language L prime. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-6ebf4d93040b75ca

F,L,L

Read as: abstract logic L is at least as expressive as ordinary first order logic

Means: This expression denotes abstract logic L is at least as expressive as ordinary first order logic. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-6f062dbc76f1e362

qr(E)n

Read as: the quantifier rank of formula E is less than or equal to n

Means: This expression denotes the quantifier rank of formula E is less than or equal to n. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-7036002389468cf1

|N|*

Read as: the domain of structure N star

Means: This expression denotes the domain of structure N star. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-72dfcfb0c470ac25

L

Read as: L

Means: This expression denotes L. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-78681e74c6b7c795

a,b,c|M|<ω

Read as: sequences a, b, and c are finite sequences over the domain of structure M

Means: This expression denotes sequences a, b, and c are finite sequences over the domain of structure M. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-7997c4f3be17c7ce

Read as: satisfies

Means: This expression denotes satisfies. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-79d4c7f9c8579543

Read as: the natural numbers

Means: This expression denotes the natural numbers. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-7a03384e6e8b8519

Read as: is at least as expressive as

Means: This expression denotes is at least as expressive as. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-7eae821ae4a8e699

a

Read as: sequence a

Means: This expression denotes sequence a. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-8238c028f61fc0f7

A

Read as: formula A

Means: This expression denotes formula A. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-8254c329a92850f6

k

Read as: k

Means: This expression denotes k. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-8487ac0d5d0e0baa

ModL(L1)(E)=ModL(L2)(F)

Read as: the class of models in logic L sub one over language L satisfying formula E equals the class of models in logic L sub two over language L satisfying formula F

Means: This expression denotes the class of models in logic L sub one over language L satisfying formula E equals the class of models in logic L sub two over language L satisfying formula F. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-86a3c627c41e4a04

S(a,b,c)

Read as: S open parenthesis sequence a comma sequence b comma sequence c close parenthesis

Means: This expression denotes S open parenthesis sequence a comma sequence b comma sequence c close parenthesis. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-89add2d62a2bcafe

NnE

Read as: structure N sub n does not satisfy formula E

Means: This expression denotes structure N sub n does not satisfy formula E. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-8b7c6a4377379ef5

NLD

Read as: structure N satisfies in logic L formula D

Means: This expression denotes structure N satisfies in logic L formula D. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-8c2574892063f995

R

Read as: R

Means: This expression denotes R. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-8de0b3c47f112c59

S

Read as: S

Means: This expression denotes S. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-8fd0b5c24f4f7eb3

b

Read as: sequence b

Means: This expression denotes sequence b. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-9075723bf690f4e2

I

Read as: the family I of partial isomorphisms

Means: This expression denotes the family I of partial isomorphisms. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-930f5c4baa5c7864

Read as: the universal quantifier

Means: This expression denotes the universal quantifier. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-9312a3da019247ac

NDN

Read as: structure N satisfies formula D sub structure N

Means: This expression denotes structure N satisfies formula D sub structure N. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-93c496310a0d1ef3

xF

Read as: for every x, formula F

Means: This expression denotes for every x, formula F. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-94a202c8b76d46aa

M[X,b1,,bn]

Read as: the expansion of structure M by relation X comma b sub one comma and so on comma b sub n

Means: This expression denotes the expansion of structure M by relation X comma b sub one comma and so on comma b sub n. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-95f85ca7e31768f1

F

Read as: formula F

Means: This expression denotes formula F. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-980ea4bd1d2d3688

|Mn|={a|M|:R(a,n)};|Nn|={a|N|:S(a,n)};|M|<ωn={a|M|<ω:R(a,n)};|N|<ωn={a|N|<ω:S(a,n)}.

Read as: first row: the domain of M sub n is the set of a in the domain of M for which R holds of a and n; the domain of N sub n is the set of a in the domain of N for which S holds of a and n. second row: the finite sequences in M sub n and N sub n are selected by the same predicates R and S

Means: This expression denotes first row: the domain of M sub n is the set of a in the domain of M for which R holds of a and n; the domain of N sub n is the set of a in the domain of N for which S holds of a and n. second row: the finite sequences in M sub n and N sub n are selected by the same predicates R and S. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-9fe51780ae6b2b6c

a,bI

Read as: the pair of sequences a and b belongs to the family I

Means: This expression denotes the pair of sequences a and b belongs to the family I. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-a1188a9bd7b35397

M0LE

Read as: structure M sub zero satisfies in logic L formula E

Means: This expression denotes structure M sub zero satisfies in logic L formula E. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-a25d9c9866c45520

Γ0Γ

Read as: Gamma sub zero is a subset of Gamma

Means: This expression denotes Gamma sub zero is a subset of Gamma. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-a2b0fc056ee9f397

XMn+1

Read as: X is a subset of M superscript n plus one

Means: This expression denotes X is a subset of M superscript n plus one. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-a2eefc04ccc51318

|M|<ω

Read as: the set of finite sequences over the domain of structure M

Means: This expression denotes the set of finite sequences over the domain of structure M. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-a43e0d8c06476226

S

Read as: S prime

Means: This expression denotes S prime. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-a67dd557513ba88e

NDM

Read as: structure N satisfies formula D sub structure M

Means: This expression denotes structure N satisfies formula D sub structure M. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-a83dd0ccbffe39d0

I

Read as: I

Means: This expression denotes I. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-a966b57803832d2f

EL1(L)

Read as: formula E is in L sub one open parenthesis language L close parenthesis

Means: This expression denotes formula E is in L sub one open parenthesis language L close parenthesis. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-a98a37ed74a37a4b

n*

Read as: the nonstandard number n star

Means: This expression denotes the nonstandard number n star. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-ab9aa52b0f2801a8

In(a,b)

Read as: I sub n open parenthesis sequence a comma sequence b close parenthesis

Means: This expression denotes I sub n open parenthesis sequence a comma sequence b close parenthesis. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-af35f011a762cdb7

LL

Read as: language L is a subset of language L'

Means: This expression denotes language L is a subset of language L'. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-b17fdb0aa1876209

M*

Read as: structure M star

Means: This expression denotes structure M star. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-b1fe6500b48a240c

NLE

Read as: structure N does not satisfy in logic L formula E

Means: This expression denotes structure N does not satisfy in logic L formula E. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-b3a37c7732864b53

MLE

Read as: structure M does not satisfy in logic L formula E

Means: This expression denotes structure M does not satisfy in logic L formula E. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-b3b4cd7340bd3361

ModL(L)(F)={M:M[a]ModL(L)(E) for some a|M|},

Read as: the models of formula F in logic L over language L prime are exactly the reducts whose expansion by some domain element is a model of formula E over language L

Means: This expression denotes the models of formula F in logic L over language L prime are exactly the reducts whose expansion by some domain element is a model of formula E over language L. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-b4ae0048e5796391

MLE

Read as: structure M satisfies in logic L formula E

Means: This expression denotes structure M satisfies in logic L formula E. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-b4eb094698264199

EL(L)

Read as: formula E prime belongs to logic L over language L prime

Means: This expression denotes formula E prime belongs to logic L over language L prime. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-b50bb8940da5b931

L

Read as: language L

Means: This expression denotes language L. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-b69ae00edefffd3c

F,

Read as: ordinary first order logic F together with its satisfaction relation

Means: This expression denotes ordinary first order logic F together with its satisfaction relation. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-b8bd1433379cc157

DM

Read as: formula D sub structure M

Means: This expression denotes formula D sub structure M. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-be42cb77e83a154e

R(x,c1,cn)

Read as: the atomic formula R of x and constants c sub one through c sub n

Means: This expression denotes the atomic formula R of x and constants c sub one through c sub n. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-bf390920f1a8f8a2

MnN

Read as: structure M and structure N agree on all formulas of quantifier rank at most n

Means: This expression denotes structure M and structure N agree on all formulas of quantifier rank at most n. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-bfd8bc2e94e3db57

N0

Read as: structure N sub zero

Means: This expression denotes structure N sub zero. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-c02a58a890c84f29

In(,)

Read as: I sub n open parenthesis the empty set comma the empty set close parenthesis

Means: This expression denotes I sub n open parenthesis the empty set comma the empty set close parenthesis. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-c2369011362bae02

M*

Read as: structure M star

Means: This expression denotes structure M star. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-c8f62efc59874339

R(x,c1,,cn)

Read as: the atomic formula R of x and constants c sub one through c sub n

Means: This expression denotes the atomic formula R of x and constants c sub one through c sub n. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-ca08f4e1e8dd9675

Mod(L)(G)=Mod(L)(E)Mod(L)(F)

Read as: the class of models in logic L satisfying formula G equals the class of models in logic L satisfying formula E intersect the class of models in logic L satisfying formula F

Means: This expression denotes the class of models in logic L satisfying formula G equals the class of models in logic L satisfying formula E intersect the class of models in logic L satisfying formula F. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-ca1c4f6f4b7553ad

NnM

Read as: structure N and structure M agree on all formulas of quantifier rank at most n

Means: This expression denotes structure N and structure M agree on all formulas of quantifier rank at most n. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-ca5f50f43fe02d8d

M

Read as: structure M prime

Means: This expression denotes structure M prime. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-ca978112ca1bbdca

a

Read as: a

Means: This expression denotes a. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-cb623a763c50ee14

Mn*

Read as: structure M sub n star

Means: This expression denotes structure M sub n star. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-cec4b8919e5f12a5

P

Read as: P prime

Means: This expression denotes P prime. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-d055ee4dbcdd0c8b

B

Read as: formula B

Means: This expression denotes formula B. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-d28b557f0867e38d

|N|<ω

Read as: the set of finite sequences over the domain of structure N

Means: This expression denotes the set of finite sequences over the domain of structure N. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-d2911734c8e8bb2a

n*k>0

Read as: n star minus k is greater than zero

Means: This expression denotes n star minus k is greater than zero. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-d5ea220ea0c041f7

D={DM:MLE}

Read as: formula D is the finite disjunction of the formulas D sub M for structures M that satisfy formula E in logic L

Means: This expression denotes formula D is the finite disjunction of the formulas D sub M for structures M that satisfy formula E in logic L. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-d9b614fc19823f62

MLE

Read as: structure M prime satisfies formula E prime in logic L

Means: This expression denotes structure M prime satisfies formula E prime in logic L. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-d9d0ca0c4215b9f1

MLN

Read as: structure M is elementarily equivalent to structure N in logic L

Means: This expression denotes structure M is elementarily equivalent to structure N in logic L. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-e06d4126730df978

x(R(x,c1,,cn)F)

Read as: for every x, if R holds of x and constants c sub one through c sub n, then formula F

Means: This expression denotes for every x, if R holds of x and constants c sub one through c sub n, then formula F. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-e32b0a33375051fc

FL2(L)

Read as: formula F is in L sub two open parenthesis language L close parenthesis

Means: This expression denotes formula F is in L sub two open parenthesis language L close parenthesis. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-e5faf7f7c6a1d52b

NnLE

Read as: structure N sub n does not satisfy in logic L formula E

Means: This expression denotes structure N sub n does not satisfy in logic L formula E. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-e632b7095b0bf32c

T

Read as: T

Means: This expression denotes T. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-ec0435d6526d88b3

qI

Read as: q belongs to the family I of partial isomorphisms

Means: This expression denotes q belongs to the family I of partial isomorphisms. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-ef4bb1e9892269f8

In(,)

Read as: I sub n open parenthesis the empty set comma the empty set close parenthesis

Means: This expression denotes I sub n open parenthesis the empty set comma the empty set close parenthesis. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-f06c5d3ec6388312

c=a1,an,b

Read as: sequence c consists of a sub one through a sub n followed by b

Means: This expression denotes sequence c consists of a sub one through a sub n followed by b. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-f0898f39e9a75aa3

bM

Read as: b is in M

Means: This expression denotes b is in M. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-f2079804fc84f390

|M||M|<ω

Read as: the domain of structure M together with its finite sequences

Means: This expression denotes the domain of structure M together with its finite sequences. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-f2708d9e29712594

Read as: the existential quantifier

Means: This expression denotes the existential quantifier. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-f3f60851424cc81d

{M:MLE}

Read as: the set of structure M such that structure M satisfies in logic L formula E

Means: This expression denotes the set of structure M such that structure M satisfies in logic L formula E. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-f67ab10ad4e4c531

F

Read as: F

Means: This expression denotes F. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-f6fbfa6138a1ac7f

T(a,b,c)

Read as: T open parenthesis sequence a comma b comma sequence c close parenthesis

Means: This expression denotes T open parenthesis sequence a comma b comma sequence c close parenthesis. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-f7b922353ddd2346

L(L)L(L)

Read as: L open parenthesis language L close parenthesis is a subset of L open parenthesis language L' close parenthesis

Means: This expression denotes L open parenthesis language L close parenthesis is a subset of L open parenthesis language L' close parenthesis. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-f80eece1214c4a79

D1

Read as: formula D sub one

Means: This expression denotes formula D sub one. In compactness and Lowenheim Skolem properties for abstract logics, it proves that partial isomorphism implies equivalence for a normal logic with the Lowenheim Skolem property.

Equation form expr-f888d2e33b66d0c5

D

Read as: formula D

Means: This expression denotes formula D. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-fa3ba3bea2815bfb

L2,L2

Read as: abstract logic L sub two together with its satisfaction relation

Means: This expression denotes abstract logic L sub two together with its satisfaction relation. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Equation form expr-fc3a62af67dce2ed

L,LF,

Read as: ordinary first order logic is at least as expressive as abstract logic L

Means: This expression denotes ordinary first order logic is at least as expressive as abstract logic L. In Lindstrom's maximality theorem, it reduces abstract sentences to first-order sentences and derives a contradiction from compactness.

Equation form expr-fd91a759a4fd118d

M[a]

Read as: the expansion of structure M by relation a

Means: This expression denotes the expansion of structure M by relation a. In abstract logics and their normality conditions, it defines model classes, normal abstract logics, relativization, and expressive strength.

Definition: abstract logic

Defines an abstract logic as a language-indexed collection of sentences together with a satisfaction relation between structures and those sentences. It identifies ordinary first-order logic as the principal example.

Source

Definition: model class and elementary equivalence

Defines the class of models of an abstract sentence and says that two structures are elementarily equivalent in an abstract logic when they satisfy exactly the same sentences of that logic.

Source

Definition: normal abstract logic

Lists the seven closure and invariance requirements for a normal abstract logic: language monotonicity, finite expansion dependence, isomorphism invariance, renaming, Boolean closure, quantification, and relativization.

Source

Definition: expressive comparison of logics

Defines one abstract logic to be at least as expressive as another when every sentence of the first has a sentence of the second with the same class of models; mutual expressibility defines equivalence.

Source

Definition: compactness property

An abstract logic has compactness when a set of its sentences is satisfiable whenever every finite subset is satisfiable.

Source

Definition: downward Lowenheim Skolem property

An abstract logic has the downward Lowenheim Skolem property when every satisfiable set of its sentences has an enumerable model.

Source

Theorem: partial isomorphism in a normal logic

States that for a normal abstract logic with the downward Lowenheim Skolem property, partially isomorphic structures satisfy the same sentences of the abstract logic.

Source

Figure: structure containing an internal partial isomorphism

Shows one ambient structure containing expanded copies of structures M and N. Each copy contains its original substructure, and a two-headed arrow labeled I connects the sequence domains used for the internal partial isomorphism.

Source

Diagram: internal partial-isomorphism construction

A rounded rectangle represents the ambient structure. Two nested circles on the left represent M inside M star, two nested circles on the right represent N inside N star, and a bidirectional curved arrow labeled I links their sequence regions.

Source

Lemma: bounded equivalence implies first-order definability

If membership in the model class of an abstract sentence is invariant under equivalence through some finite quantifier rank n, the sentence has the same models as a first-order sentence.

Source

Theorem: Lindstrom's theorem

States that a normal logic with compactness and the downward Lowenheim Skolem property is no more expressive than first-order logic and hence is equivalent to first-order logic.

Source

Displayed construction of indexed domains

Defines the domains of M sub n and N sub n, and their finite-sequence domains, as the elements selected by the coding predicates R and S at index n.

Source

Cross-reference reference-000542

the thm labeled compactness

Source occurrence

Cross-reference reference-000543

the thm labeled downward ls

Source occurrence

Cross-reference reference-000544

the rem labeled substructure

Source occurrence

Cross-reference reference-000545

the defn labeled partialisom

Source occurrence

Cross-reference reference-000546

the thm labeled p isom2

Source occurrence

Cross-reference reference-000547

the defn labeled partialisom

Source occurrence

Cross-reference reference-000548

the thm labeled p isom1

Source occurrence

Cross-reference reference-000549

the prop labeled qr finite

Source occurrence

Cross-reference reference-000550

the lem labeled lindstrom

Source occurrence

Cross-reference reference-000551

the thm labeled b n f

Source occurrence

Cross-reference reference-000552

the thm labeled abstract p isom

Source occurrence

Cross-reference reference-000553

the thm labeled abstract p isom

Source occurrence

Source disclosures