
\documentclass{article}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\usepackage{graphicx}
\usepackage{amsmath}

%TCIDATA{OutputFilter=LATEX.DLL}
%TCIDATA{Created=Mon Dec 07 18:54:39 2009}
%TCIDATA{LastRevised=Mon Dec 07 21:18:11 2009}
%TCIDATA{<META NAME="GraphicsSave" CONTENT="32">}
%TCIDATA{<META NAME="DocumentShell" CONTENT="General\Blank Document">}
%TCIDATA{CSTFile=LaTeX article (bright).cst}

\newtheorem{theorem}{Theorem}
\newtheorem{acknowledgement}[theorem]{Acknowledgement}
\newtheorem{algorithm}[theorem]{Algorithm}
\newtheorem{axiom}[theorem]{Axiom}
\newtheorem{case}[theorem]{Case}
\newtheorem{claim}[theorem]{Claim}
\newtheorem{conclusion}[theorem]{Conclusion}
\newtheorem{condition}[theorem]{Condition}
\newtheorem{conjecture}[theorem]{Conjecture}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{criterion}[theorem]{Criterion}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{example}[theorem]{Example}
\newtheorem{exercise}[theorem]{Exercise}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{notation}[theorem]{Notation}
\newtheorem{problem}[theorem]{Problem}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{remark}[theorem]{Remark}
\newtheorem{solution}[theorem]{Solution}
\newtheorem{summary}[theorem]{Summary}
\newenvironment{proof}[1][Proof]{\textbf{#1.} }{\ \rule{0.5em}{0.5em}}
\input{tcilatex}

\begin{document}


\bigskip

\bigskip 

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ Matematikai
logika zh.

\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \
2009.12. 08.

\bigskip 

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

1. Formaliz\'{a}lja a megadott $\mathcal{L}$ nyelven a k\"{o}vetkez\H{o}
defin\'{i}ci\'{o}t: \ Az adott $f(n,x)$ f\"{u}gv\'{e}nysorozat egyenletesen
konverg\'{a}l az adott $F(x)$ -hez a sz\'{a}megyenesen. ($\varepsilon >0$
-ra, $n>N$ -re $\left| f(n,x)-F(x)\right| <\varepsilon $). Sorolja fel \'{e}%
s jellemezze a felhaszn\'{a}lt nem-logikai konstansokat.

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\bigskip \thinspace \bigskip 

\bigskip 

2. a) Hat\'{a}rozza meg a k\"{o}vetkez\H{o} formula egy er\H{o}s Skolem form%
\'{a}j\'{a}t:

\qquad \qquad \qquad $\ \ \ \ \ \ \forall x(\forall yRxy\rightarrow \exists
y\rceil (Qxy\rightarrow Lxy))$

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\bigskip \thinspace \bigskip 

\thinspace 

b) Mutassa meg, hogy az ekvivalencia rel\'{a}ci\'{o} elm\'{e}lete (axi\'{o}m%
\'{a}k: reflexivit\'{a}s, szimmetria, tranzitivit\'{a}s) nem komplett.

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

3. a) Fogalmazza meg \'{e}s bizony\'{i}tsa be a kompakts\'{a}gi t\'{e}telt
(szemantikai v\'{a}ltozat)

\ \ \ b) Fogalmazza meg az analitikus f\'{a}k teljess\'{e}gi t\'{e}tel\'{e}t.

\bigskip \thinspace \bigskip 

\bigskip 

\bigskip 

\thinspace 

\bigskip \newpage 

4. Mit \'{e}rt\"{u}nk

\bigskip

a) elm\'{e}leten a szintaktik\'{a}ban?

\bigskip

\newline
\ 

\newline
\ 

\newline
\ \newline

b) axiomatiz\'{a}lhat\'{o} elm\'{e}leten?

\bigskip

\newline
\ 

\newline
\ \newline

c) egy strukt\'{u}ra elm\'{e}let\'{e}nek nem-standard modellj\'{e}n?

\bigskip

\bigskip

\newline

\newline
\ 

\newline
\ \newline
\ 

5. Mely ir\'{a}nyokban igazak az al\'{a}bbi k\"{o}vetkeztet\'{e}sek? \'{A}ll%
\'{i}t\'{a}sait indokolja r\"{o}viden!

\bigskip

a) $\Sigma $ egy elm\'{e}let a szemantikai \'{e}rtelemben \ $\Leftarrow
?\Rightarrow \;\Sigma $ egy elm\'{e}let a szintaktikai \'{e}rtelemben

\bigskip

\newline
\ 

b) $\beta $ t\'{e}tele a Peano aritmetik\'{a}nak \ $\Leftarrow ?\Rightarrow
\;\beta $ igaz a term\'{e}szetes sz\'{a}mok szok\'{a}sos modellj\'{e}ben

\bigskip

\newline
\ 

c) $\models \exists x(\alpha \rightarrow \beta )\,$\ $\Leftarrow
?\Rightarrow \;\models \exists x\alpha \rightarrow \exists x\beta $

\ \ \ ahol $\alpha $ \'{e}s $\beta $ tetsz\H{o}leges, de r\"{o}gz\'{i}tett
formul\'{a}k.

\bigskip

\newline
\ 

\bigskip 

6. Adjon p\'{e}ld\'{a}t

\bigskip

a) komplett elm\'{e}letre

\bigskip

\newline
\ 

b) nem els\H{o}rend\H{u} tulajdons\'{a}gra.

\bigskip

\newline
\ 

\end{document}

