J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e
● C o n t e n t s
● C u r r e n t e v e n t s
● R a n d o m a r t i c l e
● A b o u t W i k i p e d i a
● C o n t a c t u s
● D o n a t e
C o n t r i b u t e
● H e l p
● L e a r n t o e d i t
● C o m m u n i t y p o r t a l
● R e c e n t c h a n g e s
● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t
● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t
● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e
● C o n t r i b u t i o n s
● T a l k
( T o p )
1
D e f i n i t i o n
2
S e e a l s o
3
R e f e r e n c e s
T o g g l e t h e t a b l e o f c o n t e n t s
D i a g r a m ( m a t h e m a t i c a l l o g i c )
2 l a n g u a g e s
● D e u t s c h
● ف ا ر س ی
E d i t l i n k s
● A r t i c l e
● T a l k
E n g l i s h
● R e a d
● E d i t
● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d
● E d i t
● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e
● R e l a t e d c h a n g e s
● U p l o a d f i l e
● S p e c i a l p a g e s
● P e r m a n e n t l i n k
● P a g e i n f o r m a t i o n
● C i t e t h i s p a g e
● G e t s h o r t e n e d U R L
● D o w n l o a d Q R c o d e
● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F
● P r i n t a b l e v e r s i o n
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
Definition [ edit ]
Let
L
{\displaystyle {\mathcal {L}}}
be a first-order language and
T
{\displaystyle T}
be a theory over
L
.
{\displaystyle {\mathcal {L}}.}
For a model
A
{\displaystyle {\mathfrak {A}}}
of
T
{\displaystyle T}
one expands
L
{\displaystyle {\mathcal {L}}}
to a new language
L
A
:=
L
∪
{
c
a
:
a
∈
A
}
{\displaystyle {\mathcal {L}}_{A}:={\mathcal {L}}\cup \{c_{a}:a\in A\}}
by adding a new constant symbol
c
a
{\displaystyle c_{a}}
for each element
a
{\displaystyle a}
in
A
,
{\displaystyle A,}
where
A
{\displaystyle A}
is a subset of the domain of
A
.
{\displaystyle {\mathfrak {A}}.}
Now one may expand
A
{\displaystyle {\mathfrak {A}}}
to the model
A
A
:=
(
A
,
a
)
a
∈
A
.
{\displaystyle {\mathfrak {A}}_{A}:=({\mathfrak {A}},a)_{a\in A}.}
The positive diagram of
A
{\displaystyle {\mathfrak {A}}}
, sometimes denoted
D
+
(
A
)
{\displaystyle D^{+}({\mathfrak {A}})}
, is the set of all those atomic sentences which hold in
A
{\displaystyle {\mathfrak {A}}}
while the negative diagram, denoted
D
−
(
A
)
,
{\displaystyle D^{-}({\mathfrak {A}}),}
thereof is the set of all those atomic sentences which do not hold in
A
{\displaystyle {\mathfrak {A}}}
.
The diagram
D
(
A
)
{\displaystyle D({\mathfrak {A}})}
of
A
{\displaystyle {\mathfrak {A}}}
is the set of all atomic sentences and negations of atomic sentences of
L
A
{\displaystyle {\mathcal {L}}_{A}}
that hold in
A
A
.
{\displaystyle {\mathfrak {A}}_{A}.}
[1] [2] Symbolically,
D
(
A
)
=
D
+
(
A
)
∪
¬
D
−
(
A
)
{\displaystyle D({\mathfrak {A}})=D^{+}({\mathfrak {A}})\cup \neg D^{-}({\mathfrak {A}})}
.
See also [ edit ]
References [ edit ]
t
e
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=Diagram_(mathematical_logic)&oldid=1182749585 "
C a t e g o r i e s :
● M a t h e m a t i c a l l o g i c
● M o d e l t h e o r y
● M a t h e m a t i c a l l o g i c s t u b s
H i d d e n c a t e g o r i e s :
● A r t i c l e s w i t h s h o r t d e s c r i p t i o n
● S h o r t d e s c r i p t i o n i s d i f f e r e n t f r o m W i k i d a t a
● A l l s t u b a r t i c l e s
● T h i s p a g e w a s l a s t e d i t e d o n 3 1 O c t o b e r 2 0 2 3 , a t 0 4 : 1 2 ( U T C ) .
● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n .
● P r i v a c y p o l i c y
● A b o u t W i k i p e d i a
● D i s c l a i m e r s
● C o n t a c t W i k i p e d i a
● C o d e o f C o n d u c t
● D e v e l o p e r s
● S t a t i s t i c s
● C o o k i e s t a t e m e n t
● M o b i l e v i e w