Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fixed 14, 16 #2

Merged
merged 2 commits into from
Jun 3, 2017
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
60 changes: 40 additions & 20 deletions 14.lyx
Original file line number Diff line number Diff line change
Expand Up @@ -120,7 +120,11 @@
\begin_inset Formula $\Gamma$
\end_inset

противоречива) если

\series bold
противоречива
\series default
) если
\begin_inset Formula $\exists\varphi_{1},\ldots,\varphi_{n}$
\end_inset

Expand All @@ -136,14 +140,18 @@
\end_layout

\begin_layout Enumerate
\begin_inset Formula $\Gamma\dashv$
\begin_inset Formula $\Gamma\nvdash$
\end_inset

(
\begin_inset Formula $Г$
\end_inset

непротиворечива) если

\series bold
непротиворечива
\series default
) если
\begin_inset Formula $\lnot(\Gamma\vdash)$
\end_inset

Expand Down Expand Up @@ -305,7 +313,7 @@
\begin_inset Formula $\Rightarrow$
\end_inset


\begin_inset Formula $\varphi\in T$
\end_inset

Expand All @@ -325,7 +333,7 @@
\begin_inset Formula $\Rightarrow$
\end_inset


\begin_inset Formula $\exists q\in\sigma\setminus\sigma{\scriptstyle 1}$
\end_inset

Expand Down Expand Up @@ -364,19 +372,19 @@
\begin_inset Formula $T\vdash(\varphi\lor\lnot\varphi)$
\end_inset


\begin_inset Formula $\Rightarrow$
\end_inset


\begin_inset Formula $(\varphi\lor\lnot\varphi)\in T$
\end_inset


\begin_inset Formula $\Rightarrow$
\end_inset


\begin_inset Formula $q\in\sigma(T)=\sigma$
\end_inset

Expand Down Expand Up @@ -451,11 +459,11 @@
\begin_inset Formula $T\vdash$
\end_inset


\begin_inset Formula $\Rightarrow$
\end_inset


\begin_inset Formula $\exists\varphi{\scriptstyle 1},\ldots,\varphi{\scriptstyle n}\in T$
\end_inset

Expand All @@ -475,7 +483,7 @@
\begin_layout Standard
\begin_inset Formula
\[
\frac{\varphi_{1},\ldots,\varphi_{n}\vdash}{\varphi_{1},\ldots,\varphi_{n}\lnot\varphi\vdash}\:\frac{\varphi_{1},\ldots,\varphi_{n}\lnot\varphi\vdash}{\varphi_{1},\ldots,\varphi_{n}\vdash\varphi}
\frac{\varphi_{1},\ldots,\varphi_{n}\vdash}{\varphi_{1},\ldots,\varphi_{n}\lnot\varphi\vdash}\qquad\frac{\varphi_{1},\ldots,\varphi_{n}\lnot\varphi\vdash}{\varphi_{1},\ldots,\varphi_{n}\vdash\varphi}
\]

\end_inset
Expand All @@ -484,7 +492,7 @@
\begin_inset Formula $\Rightarrow\varphi{\scriptstyle 1},\ldots,\varphi{\scriptstyle n}\vdash\varphi$
\end_inset

- доказуема
- доказуема
\begin_inset Formula $\Rightarrow T\vdash\varphi\Rightarrow\varphi\in T$
\end_inset

Expand All @@ -510,6 +518,14 @@
\end_inset

1.)
\begin_inset Formula $\varphi,\lnot\varphi\in T$
\end_inset


\begin_inset Formula $\Rightarrow T\vdash\varphi\quad T\vdash\lnot\varphi$
\end_inset


\begin_inset Formula
\[
\frac{\varphi\vdash\varphi;\lnot\varphi\vdash\lnot\varphi}{\varphi,\lnot\varphi\vdash}
Expand All @@ -518,7 +534,11 @@
\end_inset


\begin_inset Formula $\Rightarrow\varphi,\lnot\varphi\vdash$
\begin_inset Formula $\varphi,\lnot\varphi\in T$
\end_inset

и
\begin_inset Formula $\varphi,\lnot\varphi\vdash$
\end_inset

- доказуемо
Expand All @@ -544,7 +564,7 @@
\end_inset

, тогда
\begin_inset Formula $T\vdash\Leftrightarrow T=S(\sigma)$
\begin_inset Formula $T\vdash\:\Leftrightarrow\:T=S(\sigma)$
\end_inset


Expand Down Expand Up @@ -581,15 +601,15 @@
\end_inset

и
\begin_inset Formula $T\dashv$
\begin_inset Formula $T\nvdash$
\end_inset

.
Тогда
\begin_inset Formula $Т$
\end_inset

- теория сигнатуры
- теория сигнатуры
\begin_inset Formula $\sigma$
\end_inset

Expand Down Expand Up @@ -642,8 +662,8 @@
\begin_inset Formula $\Rightarrow\varphi_{1},\ldots,\varphi_{n},\lnot\varphi\vdash$
\end_inset

- доказуемо
\begin_inset Formula $\Rightarrow T\dashv$
- доказуемо
\begin_inset Formula $\Rightarrow T\vdash$
\end_inset

.
Expand All @@ -664,15 +684,15 @@
\end_inset

, то есть
\begin_inset Formula $\mathfrak{A}=<A,\sigma>$
\begin_inset Formula $\mathfrak{A}=\,<A,\,\sigma>$
\end_inset

, тогда
\series bold
элементарной теорией модели
\series default
называется множество всех предложений, истинных на этой модели:
\begin_inset Formula $Th\mathfrak{\,A}=\{\varphi\in S(\sigma)|\varphi\models\mathfrak{A}\}$
\begin_inset Formula $Th\mathfrak{\,A}=\{\varphi\in S(\sigma)\,|\,\varphi\models\mathfrak{A}\}$
\end_inset

.
Expand Down
46 changes: 26 additions & 20 deletions 16.lyx
Original file line number Diff line number Diff line change
Expand Up @@ -326,7 +326,7 @@
\end_layout

\begin_layout Subsection
Определение (машиное слово)
Определение (номер машинного слова)
\end_layout

\begin_layout Standard
Expand All @@ -345,7 +345,7 @@
\end_layout

\begin_layout Subsection
Определение( номер машинного слова)
Определение (множество номеров машинных слов)
\end_layout

\begin_layout Standard
Expand Down Expand Up @@ -376,7 +376,7 @@

\begin_layout Standard
Рассмотрим команды
\begin_inset Formula $k_{ij},q_{ij}\rightarrow q_{s}l\varDelta,\varDelta=\begin{cases}
\begin_inset Formula $k_{ij},q_{i}j\rightarrow q_{s}l\varDelta,\varDelta=\begin{cases}
L\\
R\\
\emptyset
Expand All @@ -387,11 +387,11 @@ R\\
\end_layout

\begin_layout Standard
\begin_inset Formula $\gamma(k_{ij})=p_{c(i,j)}^{\sigma}$
\begin_inset Formula $\gamma(k_{ij})=p_{c(i,j)}^{\delta}$
\end_inset

,
\begin_inset Formula $S=2^{s}3^{L}5^{\xi},\xi=\begin{cases}
\begin_inset Formula $\delta=2^{s}3^{L}5^{\xi},\xi=\begin{cases}
1 & \varDelta=\emptyset\\
2 & \varDelta=R\\
3 & \varDelta=L
Expand All @@ -402,19 +402,19 @@ R\\
\end_layout

\begin_layout Subsection
Определение
Определение (номер программы МТ)
\end_layout

\begin_layout Standard
Пусит П-программа машины Тьюринга,
Пусть П - программа машины Тьюринга,
\begin_inset Formula $\text{\gamma(П})=2^{3}3^{n}\text{П\gamma}(k_{ij})$
\end_inset

-код
\end_layout

\begin_layout Standard
\begin_inset Formula $n=max\{i|q_{i}\text{встречается в П}\}$
\begin_inset Formula $n=max\{i\,|\,q_{i}\text{встречается в П}\}$
\end_inset


Expand All @@ -425,7 +425,7 @@ R\\
\end_layout

\begin_layout Subsection
Предложение
Предложение (множество номеров программ МТ)
\end_layout

\begin_layout Standard
Expand Down Expand Up @@ -455,7 +455,8 @@ R\\
\begin_layout Standard
1)
\begin_inset Formula $t(x,y)=\begin{cases}
\gamma(\alpha'ql\alpha\beta'), & \text{если }x=\gamma(\text{П})\text{,}y=\gamma(\alpha q_{i}j\beta)\text{П}:\alpha q_{i}j\beta\rightarrow\alpha'q_{e}\alpha\beta'\\
\gamma(\alpha'q_{\text{i}}\alpha\beta'), & \text{если }x=\gamma(\text{П})\text{,}y=\gamma(\alpha q_{i}j\beta)\\
& \text{П}:\alpha q_{i}j\beta\xrightarrow[1\,\text{шаг}]{}\alpha'q_{e}\alpha\beta'\\
0, & \text{иначе}
\end{cases}$
\end_inset
Expand All @@ -466,7 +467,8 @@ R\\
\begin_layout Standard
2)
\begin_inset Formula $T(x,y,z,t)=\begin{cases}
1, & \text{если }x=\gamma(\text{П})\text{,}y=\gamma(\alpha q_{i}j\beta),A:\alpha q_{i}j\beta\rightarrow\alpha q_{0}01^{z+1}0\beta'\\
1, & \text{если }x=\gamma(\text{П})\text{,}y=\gamma(\alpha q_{i}j\beta)\\
& \text{П}:\alpha q_{i}j\beta\xrightarrow[\leq t\,\text{шагов}]{}\alpha'q_{0}01^{z+1}0\beta'\\
0 & \text{иначе}
\end{cases}$
\end_inset
Expand All @@ -477,7 +479,8 @@ R\\
\begin_layout Standard
3)
\begin_inset Formula $T^{n}(a,x_{1}\ldots x_{n},z,t)=\begin{cases}
1, & \text{если \alpha=\gamma(П)}\text{,}\text{П}:q_{1}01^{x_{1}+1}0\ldots01^{x_{n}+1}0\rightarrow\alpha q_{0}01^{z+1}0\beta\\
1, & \text{если \alpha=\gamma(П)}\text{}\\
& \text{П}:q_{1}01^{x_{1}+1}0\ldots01^{x_{n}+1}0\xrightarrow[\leq t\,\text{шагов}]{}\alpha q_{0}01^{z+1}0\beta\\
0, & \text{иначе}
\end{cases}$
\end_inset
Expand Down Expand Up @@ -541,10 +544,10 @@ R\\
\end_inset

вычислима на машине Тьюринга с программой
\begin_inset Formula $\text{П}_{1}$
\begin_inset Formula $\text{П}$
\end_inset


,
\begin_inset Formula $\alpha=\gamma(\text{П})\text{.}$
\end_inset

Expand Down Expand Up @@ -580,7 +583,7 @@ R\\
\begin_inset Formula $T^{n}(\alpha,x_{1}\ldots x_{n},l(y),r(y))\neq1\Rightarrow g(x_{1}\ldots x_{n},y)\neq0\Rightarrow l(\mu y[g(x_{1}\ldots x_{n},y)])$
\end_inset

-не определена
- не определена
\begin_inset Formula $\Rightarrow f(x)=l[\mu y[g(\ldots)]$
\end_inset

Expand All @@ -592,8 +595,11 @@ R\\
\begin_inset Formula $f(x_{1}\ldots x_{n})=z\Rightarrow\exists t\in\mathbb{N}$
\end_inset

так что
\begin_inset Formula $\text{П:}q_{1}01^{x_{1}+1}0\ldots01^{x_{n}+1}\Rightarrow\alpha q_{0}01^{z+1}0\beta$
такое что
\end_layout

\begin_layout Standard
\begin_inset Formula $\text{П:}q_{1}01^{x_{1}+1}0\ldots01^{x_{n}+1}\xrightarrow[t\,\text{шагов}]{}\alpha q_{0}01^{z+1}0\beta$
\end_inset


Expand Down Expand Up @@ -716,8 +722,8 @@ R\\
\end_layout

\begin_layout Standard
ЧРФ=Выч.
на машине Тьюренга(ВТ)=ПВТ
ЧРФ = Выч.
на машине Тьюренга (ВТ) = ПВТ
\end_layout

\begin_layout Standard
Expand Down