|
|
Oberseminar Logik und Sprachtheorie

Das Oberseminar findet in der Regel dienstags von 18 bis 20 Uhr im Seminarraum A104, Sand 14 statt.
Sommersemester 2009
- 21.4. Thomas Piecha (Tübingen): Inversion of Logical Rules by Definitional Reflection
- 12.5. Heinrich Herre (Leipzig): Formal Ontology - A New Interdisciplinary Research Field
- 16.6. Kai Wehmeier (Irvine/Nancy): Subjunctivity and Cross-World Predication
- 21.7. Laurent Keiff (Lille): Dialogues and GTS games. Some remarks about the meaning of logical constants
Wintersemester 2008/2009
- 21.10. Peter Schroeder-Heister (Tübingen): Definitional Reflection and Basic Logic
- 28.10. Peter Schroeder-Heister (Tübingen): The categorical and the hypothetical: A critique of certain fundamental assumptions of standard semantics
- 11.11. Ernst Zimmermann: A Variety of Natural Deduction
- 13.1. Helge Rückert (Universität Mannheim): Die Dialogische Logik als semantischer Ansatz
- 17.2. Luiz Carlos Pereira (Rio de Janeiro): Constructive fragments of classical logic
- 31.3. Gabriele Usberti (Università degli Studi di Siena): The notion of c-justification for atomic statements
Sommersemester 2008
- 28.5. Ernst Zimmermann: Combinatorial Proofs of Confluence and Strong Normalisation in Natural Deduction
- 2.6. Jean-Yves Béziau (Université de Neuchâtel): Structures of Truth Values
- 15.7. Ernst Zimmermann: Lambek Calculus in Natural Deduction
- 21.7. Wagner de Campos Sanz (UFG, Goiânia): Peirce Rule, Subformula Principle and Separabilty of Logical Constants
- 31.7. Norihiro Kamide (Waseda Institute for Advanced Study, Tokyo): Generalizing paraconsistent negations
Wintersemester 2007/2008
- 23.10. Luca Tranchini (Siena): The meaning of negation: a proposal
- 29.11. Aarne Ranta (Chalmers TH, Göteborg): Dialogue Systems and Type Theory
- 13.3. Wagner de Campos Sanz (UFG, Goiânia): Falsity Preservation
Wintersemester 2006/2007
- 20.-21.1. Workshop on Logic
- Enrico Moriconi (Pisa): On the Inversion Principle
- Peter Schroeder-Heister (Tübingen): Inversion Principles and Definitional Reflection
- Michael Arndt (Tübingen): A Hypergraph Interpretation of Gentzen's Logistic Calculus
- Thomas Piecha (Tübingen): Some Remarks on the Physical Interpretation of Church's Thesis
- Luiz Carlos Pereira (Rio de Janeiro): Multiple Conclusion Intuitionistic Systems
- Edward Hermann Haeusler (Rio de Janeiro): On Some Relations between Fragments of Classical, Intuitionistic and Minimal Logic
- Laura Tesconi (Pisa): A Strong Normalization Theorem for Natural Deduction with General Elimination Rules
- Ernst Zimmermann (Tübingen): A Combinatorial Proof of Strong Normalization in Natural Deduction and Simple Type Theory
- 23.1. Reinhard Kahle (Universität Coimbra, Portugal): Rekursionstheoretische Charakterisierungen von Komplexitätsklassen und NC^k
Sommersemester 2006
- 30.5. Christian Jacques Rentería (PUC Rio de Janeiro): A Natural Deduction System for Propositional Linear Temporal Logic
- 28.6. Ernst Zimmermann: Normalisation of Arithmetic
Wintersemester 2005/2006
- 18.10. Roy Dyckhoff (St Andrews): Decision methods for linearly ordered Heyting algebras
- 16.11. Ernst Zimmermann: Generalisations of Kripke Structures
- 7.12. Christian Jacques Rentería (PUC Rio de Janeiro): Labeled Natural Deduction for Quantifiers
- 14.12. Birgit Henningsen: Entropie als Komplexitätsmaß für Beweise
- 25.1. Rainer Lüdeke: Übersetzung von logischen Sequenzen in GML-Graphen
- 25.1. Stefan Elser: Übersetzung von logischen Sequenzen in LaTeX-Graphen
- 22.2. Ernst Zimmermann: Substructural Logics in Natural Deduction
Sommersemester 2005
- 1.6. Ernst Zimmermann: A Basic Predicate Logic
- 6.7. Davi Romero de Vasconcelos (PUC Rio de Janeiro): Reasoning about Games via Temporal Logic
- 13.7. Michael Arndt (Tübingen): Logical Tomography
- 21.7. Tobias Heindel: Rewriting in a Lattice and its Generalizations
- 28.7. Bartosz Więckowski: Quantified Modal Logic: Denotational vs. Substitutional
Wintersemester 2004/2005
- 10.11. Marcelo da Silva Corrêa: A Logical and a Categorical Characterization for a Partial Non-commutative Combining Operation
- 19.11. Roy Dyckhoff (St Andrews): Focused Proof Systems in Intuitionistic Logic
- 21.1. Luiz Carlos Pereira (PUC Rio de Janeiro): Bad Reductions and the Identity Problem
- 24.1. Edward Hermann Haeusler (PUC Rio de Janeiro): A Game-based proof of the PSPACE-completeness of Intuitionistic
Propositional Logic
- 18.2. Ernst Zimmermann: Ordinals for Combinatorial Proofs of Termination in Natural Deduction
Sommersemester 2004
- 4.5. Ernst Zimmermann: Logik und Verbände
- 6.7. Ernst Zimmermann: Ordinale Arithmetik und Verallgemeinerte Sigma-0 Vollständigkeit
- 20.7. Lew Gordeew: Kombinatorische Reduktion des P-NP Problems
Wintersemester 2003/2004
- 12.11. Michael Arndt (Tübingen): Informationsgefüge - Eine Theorie subjektiven begrifflichen Inhaltes
- 16.1. Pavel Materna: Transparent Intensional Logic: Fundamentals
- 16.1. Marie Duzi: Attitudes: Hyperintensional vs. intensional contexts
- 26.1. Ernst Zimmermann: Natürliches Schliessen mit Singulären Annahmen
- 4.2. Tobias Heindel: Extending the Lambda Calculus towards a Process Calculus
Sommersemester 2003
- 7.5. Michael Arndt (Tübingen): Intensions as Processes
- 21.5. Michael Arndt (Tübingen): Language as Process
- 28.5. Ernst Zimmermann: Intuitionistic Modal Propositional Logic
- 3.6. Edward Hermann Haeusler (Rio de Janeiro): Theory of Computation and Formal Methods in the Dept of Informatics of PUC-RIO
- 11.6. Edward Hermann Haeusler (Rio de Janeiro): Theory of Computation and Formal Methods in the Dept of Informatics of PUC-RIO
- 24.6. Tobias Heindel: From Reduction Sequences to Function Processes
- 2.7. Jörg Hudelmaier: Randomisierte binäre Suchbäume
- 8.7. Edward Hermann Haeusler (Rio de Janeiro): Using Topos Theory for Providing Semantics of Anticipatory Operators
- 16.7. Tobias Heindel: From Reduction Sequences to Function Processes
- 28.7. Ernst Zimmermann: Strong Normalisation by Means of Natural Deduction
Wintersemester 2000/2001
Sommersemester 2000
Wintersemester 1999/2000
Sommersemester 1999
Wintersemester 1998/99
Sommersemester 1998
- 16.6. Rodrigo Readi-Nasser (Kaiserslautern): Logisches Programmieren und Prawitz' Normalform
- 31.7. Monika Seisenberger (München): Higmans Lemma
Wintersemester 1997/98
|