Эверт Виллем Бет: Голланд философ және логик ғалымы

Dutch philosopher and logician

Evert Willem Beth (7 July 1908 – 12 April 1964) was a Dutch philosopher and logician, whose work principally concerned the foundations of mathematics. He was a member of the Significs Group.

Beth was born in Almelo, a small town in the eastern Netherlands. His father had studied mathematics and physics at the University of Amsterdam, where he had been awarded a PhD. Evert Beth studied the same subjects at Utrecht University, but then also studied philosophy and psychology. His 1935 PhD was in philosophy. In 1946, he became professor of logic and the foundations of mathematics in Amsterdam. Apart from two brief interruptions – a stint in 1951 as a research assistant to Alfred Tarski, and in 1957 as a visiting professor at Johns Hopkins University – he held the post in Amsterdam continuously until his death in 1964. His was the first academic post in his country in logic and the foundations of mathematics, and during this time he contributed actively to international cooperation in establishing logic as an academic discipline. In 1953 he became member of the Royal Netherlands Academy of Arts and Sciences. He died in Amsterdam.

The Beth definability theorem states that for first order logic a property (or function or constant) is implicitly definable if and only if it is explicitly definable. Further explanation is provided under Beth definability.

Beth's most famous contribution to formal logic is semantic tableaux, which are decision procedures for propositional logic and first order logic. It is a semantic method—like Wittgenstein's truth tables or J. Alan Robinson's resolution—as opposed to the proof of theorems in a formal system, such as the axiomatic systems employed by Frege, Russell and Whitehead, and Hilbert, or even Gentzen's natural deduction. Semantic tableaux are an effective decision procedure for propositional logic, whereas they are only semi effective for first order logic, since first order logic is undecidable, as showed by Church's theorem. This method is considered by many to be intuitively simple, particularly for students who are not acquainted with the study of logic, and it is faster than the truth table method (which requires a table with 2n rows for a sentence with n propositional letters). For these reasons, Wilfrid Hodges for example presents semantic tableaux in his introductory textbook, Logic, and Melvin Fitting does the same in his presentation of first order logic for computer scientists, First order logic and automated theorem proving. One starts out with the intention of proving that a certain set of formulae entail another formula , given a set of rules determined by the semantics of the formulae's connectives (and quantifiers, in first order logic). The method is to assume the concurrent truth of every member of and of (the negation of ), and then to apply the rules to branch this list into a tree like structure of (simpler) formulae until every possible branch contains a contradiction. At this point it will have been established that is inconsistent, and thus that the formulae of together entail .

These are a class of relational models for non classical logic (cf. Kripke semantics).