|
|
Welcome to my homepage
Iddo Tzameret

Ph.D. candidate at the
School of
Computer Science
Faculty
of Exact Sciences
Tel Aviv
University
Contact
Tel Aviv
University, Tel Aviv 69978,
Israel
Mailbox no. (Schreiber floor 1): 299
Open Space:
+972-03-6405231
Mobile: 050-393120
email: tzameret math.tau.ac.il
Research:
|
My PhD
is conducted under the supervision of Prof. Nachum
Dershowitz (Tel Aviv) and Prof. Ran
Raz (Weizmann
Institute). My current research concerns mainly with propositional and algebraic proof complexity.
In my
(M.Sc.) research I
was concentrating on topics in the theory of ordered sets; especially wqo theory and decompositions of partial
orders. Another, close issue, I was studying is ordinal analysis in proof
theory, ordinal notation systems and proof theory in general.
|

General
Fields of Interest:
|
Mathematical Logic:
complexity of proofs, bounded arithmetic, structural proof theory, ordinal
analysis, general set theory and model theory;
Complexity Theory: propositional & algebraic proof complexity, algebraic
complexity;
Finite Combinatorics: applications to complexity (of circuits, formulas,
proofs, etc.);
Infinite Combinatorics: well-quasi-ordering & better-quasi-ordering
theory, applications to proof theory and mathematical logic in general.
|

Papers
|
°
Extended Kruskal-Friedman Tree Theorem, N. Dershowitz, I. Tzameret, submitted.
°
Gap embedding for
Well-Quasi-Orderings, N.
Dershowitz, I. Tzameret, Proceedings of the 10th Workshop on
Logic, Language, Information and Computation, Electronic Notes in
Theoretical Computer Science , Ouro Preto, Minas Gerais, Brazil, 2003.
°
Quasi-Ordered Gap
Embedding, N. Dershowitz, I. Tzameret, Extended
Abstracts of the International Workshop on Termination (WST '03), Valencia, Spain, June
2003.
|
|
Dissertations
°
Kruskal-Friedman Gap
Embedding Theorems Over Well-Quasi-Orderings,
M.Sc. Thesis – December 2002.
|
|
Talks & Scribes
°
Basic
Bounded Arithmetic- Lecture notes , Tel Aviv, Logic Seminar April 2004
°
CombTalk.Zip-
Hebrew University and Tel Aviv Combinatorics Seminars, March 2003, October 2003, resp.
°
SeminarII-
Logic seminar Tel Aviv, 27/11/02,
and Combinatorics Seminar
°
Well-Quasi-Ordering of Finite Trees
- Tel Aviv Logic Seminar: 3-10/01, Technion Logic Seminar, June 2002
°
GÖdel's Incompleteness Theorem - Summary scribes I made after the
"Gödel" course in spring 2000, taught by Prof. Arnon Avron.
|

Links:
|
Journals:
|
Annals of Pure & Applied Logic, Journal
of Symbolic Logic (old), …(new),
Bulletin of Symbolic Logic, Journal
of Mathematical Logic, Journal of Logic and Computation, Archive for Mathematical Logic, Mathematical Logic Quarterly, Notre Dame Journal of Formal Logic
Computational Complexity, Journal of Computer and System Sciences, ECCC,
Theoretical Computer Science, Siam Journal on Computing
Annals of Combinatorics, Combinatorica, Electronic
Journal of Combinatorics, SIAM Journal on Discrete Mathematics, , Journal of Ordered Sets, Journal of Combinatorial Theory Series A, …Series B
|
|
Logic:
|
Mathematical Logic around the world , Logic
in Israel, ASL
|
|
Mathematics
|
PlanetMath-Interactive
Mathematics Encyclopedia
|
|
Philosophy:
|
Immanuel Kant, Edmund
Husserl, Gottlob Frege
, Arthur Schopenhauer
|
|
PDF, LaTeX:
|
TeX Research , How to write PDF files with hyperlinks , Acrobat PDF ring , Packages for TeX
|
|