Forschungsbereich Computational Logic

View Statistics Email Alert RSS Feed

Details

Organization Name (de) Name der Organisation (de)
E104-02 - Forschungsbereich Computational Logic
 
Code Kennzahl
E104-02
 
Type of Organization Organisationstyp
Research Division
Parent OrgUnit Übergeordnete Organisation
 
Active Aktiv
 

OrgUnit's Publications


Results 301-320 of 840 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
301Leigh, Graham Herbrand's theorem, cut elimination and formal grammarsPräsentation Presentation2015
302Leigh, Graham Reflection and TruthPräsentation Presentation2015
303Baaz, Matthias The Power of the Epsilon CalculusPräsentation Presentation2015
304Kuich, Werner Jewels of Automata: from Mathematics to ApplicationsPräsentation Presentation2015
305Aschieri, Federico On Classical Natural Deduction: Reduction Rules, Strong Normalization, Herbrand's TheoremPräsentation Presentation2015
306Aschieri, Federico Type Theory, Realizability and the Epsilon Substitution MethodPräsentation Presentation2015
307Kuich, Werner ; Salomaa, Arto Turku, Trees, TransducersPräsentation Presentation2015
308Kuich, Werner Weighted Finite AutomataPräsentation Presentation2015
309Eberhard, Sebastian ; Hetzl, Stefan Compressibility of finite languages by grammarsPräsentation Presentation2015
310Leitsch, Alexander ; Baaz, Matthias ; Reis, Giselle A Note on the Complexity of Classical and Intuitionistic ProofsKonferenzbeitrag Inproceedings2015
311Kuich, Werner Why We Need Semirings in Automata Theory (Extended Abstract)Konferenzbeitrag Inproceedings2015
312Eberhard, Sebastian ; Hetzl, Stefan Compressibility of Finite Languages by GrammarsArtikel Article2015
313Eberhard, Sebastian ; Hetzl, Stefan Inductive theorem proving based on tree grammarsArtikel Article2015
314LEIGH, GRAHAM E. Conservativity for theories of compositional truth via cut eliminationArtikel Article2015
315ASCHIERI, FEDERICO Constructive Forcing, CPS Translations and Witness Extraction in Interactive RealizabilityArtikel Article2015
316Fokina, E. B. ; Goncharov, S. S. ; Harizanov, V. ; Kudinov, O. V. ; Turetsky, D. Index sets for n-decidable structures categorical relative to m-decidable presentationsArtikel Article2015
317Fokina, Ekaterina ; Goncharov, Sergey ; Harizanov, Valentina ; Kudinov, Oleg ; Turetsky, Daniel Index sets for n-decidable structures categorical relative to m-decidable presentationsArtikel Article2015
318Baaz, Matthias ; Fermüller, Christian Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic LogicKonferenzbeitrag Inproceedings 2015
319Afshari, Bahareh ; Hetzl, Stefan ; Leigh, Graham Herbrand Disjunctions, Cut Elimination and Context-Free Tree GrammarsKonferenzbeitrag Inproceedings2015
320Hetzl, Stefan ; Zivota, Sebastian Tree Grammars for the Elimination of Non-prenex CutsKonferenzbeitrag Inproceedings2015