- Weak Konig's Lemma and Extensional Equality
- Automatic Model Checking of UML models Master presentation
- Proof nets for Herbrand's Theorem RICHARD MCKINLEY
- A sequent calculus demonstration of Herbrand's Richard McKinley
- A Syntactical Treatment of Simultaneous Fixpoints in the Modal -Calculus
- Realisability in weak systems of explicit mathematics
- Justifications for Common Knowledge Samuel Bucheli --Roman Kuznets --Thomas Studer
- A Buchholz rule for modal fixed point logics Gerhard Jager and Thomas Studer
- Theory of Computing Systems manuscript No. (will be inserted by the editor)
- Annotated Systems for Common Inauguraldissertation
- Expansion nets: proof nets for propositional classical logic
- Modal Fixed Point Logics Gerhard JGER 1
- Justified Belief Change Samuel Bucheli
- Self-Referentiality in Contraction-free Fragments of Modal Logic S4
- Unfolding finitist arithmetic Solomon Feferman
- Archive for Mathematical Logic manuscript No. (will be inserted by the editor)
- Common knowledge does not have the Beth Thomas Studer
- Full operational set theory with unbounded existential quantification and power set
- Canonical completeness of infinitary Gerhard Jager Mathis Kretz
- On contraction and the modal fragment Kai Brunnler Dieter Probst Thomas Studer
- Soft Linear Set Theory Richard McKinley 1
- A Deep Inference System for the Modal Logic S5 Phiniki Stouppa
- A Syntactic Realization Theorem for Justification Logics
- The NP-Completeness of Reflected Fragments of Justification Logics
- Operations, sets and classes Gerhard Jager
- An Algorithmic Interpretation of a Deep Inference System
- A Formal Model of Data Privacy Phiniki Stouppa and Thomas Studer
- Deep Sequent Systems for Modal Logic Kai Brunnler
- Proof-theoretic contributions to explicit mathematics
- Belief Change Functions for Multi-Agent Systems
- Proof-theoretic aspects of modal logic with fixed points
- ON THE CONSISTENCY STRENGTH OF THE 1 REFLECTION PRINCIPLE
- Wellordering Two Sorts: a Slow-Growing Proof Theory
- The Modal -Calculus and the Logic of Common Knowledge
- Object-Oriented Programming Explicit Mathematics
- Metapredicative Subsystems of Christian Ruede
- Basic Feasible Functionals Bounded Arithmetic
- PALC: Extending ALC ABoxes with Probabilities
- Two interpretations of WKL0 in subsystems of PA
- Dependent Choice in Explicit Mathematics
- Characterizing the Grzegorczyk hierarchy by safe recursion
- How to Normalize the Jay Dieter Probst
- Theories with self-application and computational complexity
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- Autonomous fixed point progressions and fixed point transfinite recursion
- METAPREDICATIVE AND EXPLICIT MAHLO: A PROOF-THEORETIC PERSPECTIVE
- First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
- Explicit Mathematics: Power Types and Overloading
- Locality for Classical Logic Kai Brunnler
- Syntactic Cut-Elimination for Common Knowledge Kai Brunnler and Thomas Studer
- Revising Non-Monotonic Rule-Based Belief Ricardo Wehbe
- Admissible closures of polynomial time computable arithmetic
- The non-constructive operator, xed point theories with ordinals, and the bar rule
- Extending the system T0 of explicit mathematics: the limit and Mahlo axioms
- Provable data privacy Kilian Stoffel1 and Thomas Studer2
- Master Thesis Proof-theoretic aspects of weak Konig's
- Proof-Systems for PLTL Cycling Sequents and their Use in a
- Special Issue Dialectica (50th anniversary of Gdel's Dialectica paper) Table of Contents
- Description Logic Query Answering with Relational Databases
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points
- Einige Aspekte der Modallogik S5n mit Allgemeinwissen
- Universes over Frege Structures Reinhard Kahle
- Privacy Preserving Modules for Ontologies Thomas Studer
- Sequent Calculi for Proof Search
- Studienvertrag / Learning Agreement Akademisches Jahr/Academic year ........../.......... Fachbereich/Field of study: ..........................
- Relational Semantics for Modal Logics \Lambda Bernd--Holger Schlingloff
- universitat bern institut fur informatik
- On the Proof Theory of Applicative Theories Inauguraldissertation
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- Total public announcements David Steiner
- Unser Einfluss auf das Klima Die neuesten Erkenntnisse des IPCC
- Polytime Functions in Two-Sorted Bounded Arithmetic
- A Graphical Editor for OWL Ontologies Masterarbeit
- A proof-theoretic characterization of the basic feasible functionals
- Wellordering proofs for metapredicative Mahlo Thomas Strahm
- Applikative Theorien und FregeStrukturen Inauguraldissertation
- Improving semantic query answering Norbert Kottmann and Thomas Studer
- The proof-theoretic analysis of the Suslin operator in applicative theories
- MERGING RULE-BASED BELIEF DATABASES Ricardo Wehbe
- Theories of ordinal strength 20 and 20
- On applicative theories Gerhard Jager Reinhard Kahle Thomas Strahm
- RELATIONAL REPRESENTATION OF ALN KNOWLEDGE BASES
- COMPUTING WITH COMMON KNOWLEDGE Ricardo Wehbe
- A benchmark method for the propositional modal logics K, KT, S4
- universitat bern institut fur informatik
- Variation on a theme of Schutte Gerhard Jager Dieter Probst
- Modular Sequent Systems for Modal Logic Kai Brunnler1
- On Modal -Calculus And Non-Well-Founded Set Theory
- Elementary explicit types and polynomial time operations
- Patientenerlebnis Gruppenunterricht 1977:Patientenerlebnis Gruppenunterricht 1977: Patientin E.A., 1900Patientin E.A., 1900
- Der Alumni-Newsletter der Universitt Bern 1 / 2011 Eine moderne Alumni-Organisation nur eine von vielen Frchten einer achtjhrigen Amtszeit
- Klimanderung: Aus der Vergangenheit fr die Zukunft lernen
- Bindung frs Leben: HSG Alumni Alumni-Tag der Universitt Bern
- Cut-Free Sequent Systems for Temporal Logic Kai Brunnler a
- Aspekte beweisbar totaler Funktionen in applikativen Theorien
- the Logic of Likelihood Peter Balsiger
- On Modal -Calculus and Godel-Lob Logic Luca Alberucci1
- Universes in explicit mathematics Gerhard Jager Reinhard Kahle Thomas Studer
- Logical Omniscience as a Computational Complexity Problem Sergei Artemov
- About cut elimination for logics of common Luca Alberucci
- Deciding Data Privacy for ALC Knowledge Bases
- On the treatment of predicative polymorphism in theories of explicit mathematics
- please turn page over! Tick boxes like this
- Probabilistic ABox Reasoning: Preliminary Results
- The Modal -Calculus Hierarchy over Restricted Classes of Transition Systems
- Data Privacy for ALC Knowledge Bases Phiniki Stouppa and Thomas Studer
- Deduction Chains for Common Knowledge Mathis Kretz a,1
- Weak theories of operations and types Thomas Strahm
- On the proof theory of the modal mu-calculus Thomas Studer
- Cut-free common knowledge Gerhard Jager Mathis Kretz
- CutFree Axiomatizations for Stratified Modal Fixed Point Logic
- Reflections on reflections in explicit mathematics
- Ontological Questions about Operational Set Theory
- On Feferman's operational set theory OST Gerhard Jager
- Intuitionistic fixed point theories for strictly positive operators
- A semantics for str : a calculus with
- Aspects of Computational Logic Inauguraldissertation
- Proof-Theoretic Contributions to Modal Fixed Point Logics
- Lungenentwicklung Johannes C. Schittny
- Explicit Mathematics with Positive Existential Comprehension
- Iterating operations in admissible set theory without foundation: a further aspect of
- First steps into metapredicativity in explicit mathematics
- 1 choice in a theory of sets and classes Gerhard Jager Jurg Krahenbuhl
- Syntactic Cut-Elimination for Common Knowledge Kai Brunnler and Thomas Studer
- Sequent Calculi for the Modal -Calculus over S5 Luca Alberucci
- Fixed point theories and dependent choice Gerhard Jager and Thomas Strahm
- Bar induction and ! model reflection Gerhard Jager \Lambda Thomas Strahm \Lambda
- The provably terminating operations of the subsystem PETJ of explicit mathematics
- On the proof theory of type two functionals based on primitive recursive operations
- A Hybrid Representation of Knowledge and Ricardo Wehbe
- The prooftheoretic analysis of transfinitely iterated fixed point theories
- On Two Forms of Bureaucracy in Derivations Kai Brunnler1
- Deep Inference and its Normal Form of Derivations Kai Brunnler
- An intensional fixed point theory over first order arithmetic
- Justifying induction on modal -formulae
- Kai Brunnler Cut Elimination inside a Deep Inference System for Classical
- Strictness of the modal -Calculus Hierarchy Luca Alberucci
- A Note on the Use of Sum in the Logic of Proofs Roman Kuznets
- Weak Systems of Explicit Mathematics Inauguraldissertation
- Explicit Mathematics with Positive Existential Stratified
- On the relationship between fixed points and iteration in admissible set theory without
- Two Ways to Common Knowledge Samuel Bucheli1,2
- Pseudo-Hierarchies in Admissible Set Theory without Foundation and Explicit Mathematics
- Partial Realization in Dynamic Justification Logic Samuel Bucheli , Roman Kuznets , and Thomas Studer
- The unfolding of non-nitist arithmetic Solomon Feferman Thomas Strahm
- Primitive Recursive Selection Functions for Existential Assertions over Abstract Algebras
- Proof-theoretic strength of PRON with various extensions
- About the strength of operational regularity Gerhard Jager Rico Zumbrunnen
- Der Alumni-Newsletter der Universitt Bern 2 / 2011 5. Alumni-Tag, der Tag fr unser Netzwerk an der Nacht der Forschung vom 23. September 2011
- Erasmus-Dozierendenmobilitt (Staff Mobility for Teaching Assignments = STA) Dozierende der Universitt Bern haben die Mglichkeit, einen Lehrauftrag an einer Erasmus-
- Applicative theories on tree ordinal numbers
- Erasmus vorbereitende Besuche (Preparatory Visits = PV) Zur Vorbereitung einer zuknftigen Erasmus-Kooperation knnen Hochschulen besucht werden, mit
- Weak theories of truth and explicit mathematics
- Some theories with positive induction of ordinal strength '!0
- The unfolding of non-nitist arithmetic Solomon Feferman Thomas Strahm
- LWBtheory: information about some propositional logics via the WWW
- The non-constructive operator, xed point theories with ordinals, and the bar rule
- Explicit mathematics: Wtype, models Diplomarbeit
- Technical Report TRARP1695 Automated Reasoning Project
- The quantification operator in explicit mathematics with universes
- The prooftheoretic analysis of transfinitely iterated fixed point theories
- A semantics for str : a calculus with
- Ecient loop-check for backward proof search in some non-classical propositional logics
- Fixed point theories and dependent choice Gerhard Jager and Thomas Strahm
- Bar induction and ! model reflection Gerhard Jager \Lambda Thomas Strahm \Lambda
- On the modal logic K plus theories Alain Heuerding ? , Stefan Schwendimann ?
- Systems of explicit mathematics with nonconstructive operator and join
- A benchmark method for the propositional modal logics K, KT, S4
- universitat bern institut fur informatik
- Applikative Theorien und FregeStrukturen Inauguraldissertation
- Strictness of the modal -Calculus Hierarchy Luca Alberucci
- Propositional Logics on the Computer Alain Heuerding ? , Gerhard Jager, Stefan Schwendimann ? , Michael Seyfried
- Relational Semantics for Modal Logics \Lambda Bernd--Holger Schlingloff
- Totality in applicative theories Gerhard Jager Thomas Strahm \Lambda
- universitat bern institut fur informatik
- Partial Applicative Theories and Explicit Substitutions
- Realization of Constructive Set Theory into Explicit Mathematics: a lower bound for impredicative Mahlo universe \Lambda
- A New OnePass Tableau Calculus for PLTL Stefan Schwendimann
- Polynomial time operations in explicit mathematics Thomas Strahm \Lambda
- Aspects of Computational Logic Inauguraldissertation
- On applicative theories Gerhard Jager Reinhard Kahle Thomas Strahm
- Universes over Frege Structures Reinhard Kahle
- Second order theories with ordinals and elementary comprehension
- The Logics Workbench LWB: A Snapshot Alain Heuerding 1 , Gerhard Jager, Stefan Schwendimann 1 , Michael Seyfried
- On the Proof Theory of Applicative Theories Inauguraldissertation
- Cut-Free Sequent Systems for Temporal Logic Kai Brunnler a
- Ontological Questions about Operational Set Theory
- Ordered algebras and logic G. Metcalfe, F. Paoli, and C. Tsinakis
- A Hybrid Representation of Knowledge and Ricardo Wehbe
- Logical Omniscience as a Computational Complexity Problem Sergei Artemov
- A system for consistency preserving belief change
- Variation on a theme of Schutte Gerhard Jager Dieter Probst
- Elementary explicit types and polynomial time operations
- Non-conscious word processing in a mirror-masking paradigm causing attentional distraction: An ERP-study
- Two Ways to Common Knowledge Samuel Bucheli1,2
- Studienvertrag / Learning Agreement Akademisches Jahr/Academic year ........../.......... Fachbereich/Field of study: ..........................
- How to Normalize the Jay Dieter Probst
- Systems of explicit mathematics with non-constructive -operator. Part I
- Medizinische Fakultt Institut fr Medizingeschichte
- Special Issue Dialectica (50th anniversary of Gdel's Dialectica paper) Table of Contents
- Universes in explicit mathematics Gerhard Jager Reinhard Kahle Thomas Studer
- Deciding Data Privacy for ALC Knowledge Bases
- On the relationship between fixed points and iteration in admissible set theory without
- On Modal -Calculus and Godel-Lob Logic Luca Alberucci1
- Improving semantic query answering Norbert Kottmann and Thomas Studer
- Theory of Computing Systems manuscript No. (will be inserted by the editor)
- Wellordering Two Sorts: a Slow-Growing Proof Theory
- Justifying induction on modal -formulae
- Realisability in weak systems of explicit mathematics
- Appel contributions Le genre dans le contexte de crises conomiques aggraves
- Lungenentwicklung Johannes C. Schittny
- Expansion nets: proof nets for propositional classical logic
- Sequent Calculi for Proof Search
- Weak theories of operations and types Thomas Strahm
- Partial Realization in Dynamic Justification Logic Samuel Bucheli , Roman Kuznets , and Thomas Studer
- On Feferman's operational set theory OST Gerhard Jager
- Aspekte beweisbar totaler Funktionen in applikativen Theorien
- Proof-Theoretic Contributions to Modal Fixed Point Logics
- The NP-Completeness of Reflected Fragments of Justification Logics
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points
- Characterizing the Grzegorczyk hierarchy by safe recursion
- Object-Oriented Programming Explicit Mathematics
- Automatic Model Checking of UML models Master presentation
- Syntactic Cut-Elimination for Common Knowledge Kai Brunnler and Thomas Studer
- Intuitionistic fixed point theories for strictly positive operators
- Unisport special Mittwoch, 28. Mrz 2012, 16.45 -22.15 Uhr
- Deep Inference and its Normal Form of Derivations Kai Brunnler
- On Modal -Calculus And Non-Well-Founded Set Theory
- METAPREDICATIVE AND EXPLICIT MAHLO: A PROOF-THEORETIC PERSPECTIVE
- First steps into metapredicativity in explicit mathematics
- On Two Forms of Bureaucracy in Derivations Kai Brunnler1
- Grapheme-colour-synaesthesia denotes the phenomenon that graphemes involuntarily evoke sensations of colour. Automaticity of these sensations is conventionally demon-
- About cut elimination for logics of common Luca Alberucci
- Canonical completeness of infinitary Gerhard Jager Mathis Kretz
- Privacy Preserving Modules for Ontologies Thomas Studer
- Annotated Systems for Common Inauguraldissertation
- MPA unibe Alumni c/o KPM Schanzeneckstrasse 1 Postfach 8573 3001 Bern Tel. 031 631 53 11 Fax 031 631 53 17 info@mpa-alumni.ch www.mpa-alumni.ch Liebe Alumna, lieber Alumnus
- Seniorenuniversitt Bern Programm 2011 / 12
- Reflections on reflections in explicit mathematics
- Proof-Systems for PLTL Cycling Sequents and their Use in a
- CutFree Axiomatizations for Stratified Modal Fixed Point Logic
- On contraction and the modal fragment Kai Brunnler Dieter Probst Thomas Studer
- please turn page over! Tick boxes like this
- ON THE CONSISTENCY STRENGTH OF THE 1 REFLECTION PRINCIPLE
- Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems II
- The proof-theoretic analysis of the Suslin operator in applicative theories
- About the strength of operational regularity Gerhard Jager Rico Zumbrunnen
- Frauen in der Migration Das Bild der Migrantin in der ffentlichen und politischen
- Proof-theoretic strength of PRON with various extensions
- Archive for Mathematical Logic manuscript No. (will be inserted by the editor)
- Syntactic Cut-Elimination for Common Knowledge Kai Brunnler and Thomas Studer
- Explicit Mathematics with Positive Existential Comprehension
- ORIGINAL RESEARCH ARTICLE published: xx November 2011
- Formalizing non-termination of recursive Reinhard Kahle Thomas Studer
- Explicit Mathematics: Power Types and Overloading
- Belief Change Functions for Multi-Agent Systems
- the Logic of Likelihood Peter Balsiger
- A Deep Inference System for the Modal Logic S5 Phiniki Stouppa
- Wellordering proofs for metapredicative Mahlo Thomas Strahm
- Unfolding finitist arithmetic Solomon Feferman
- On the Relationship between Choice Schemes and Iterated Class
- Journal of Experimental Psychology: Human Perception and Performance
- Der Alumni-Newsletter der Universitt Bern 1 / 2011 Eine moderne Alumni-Organisation nur eine von vielen Frchten einer achtjhrigen Amtszeit
- please turn the page Mark this way
- Pseudo-Hierarchies in Admissible Set Theory without Foundation and Explicit Mathematics
- Cut-free common knowledge Gerhard Jager Mathis Kretz
- Weak theories of truth and explicit mathematics
- Proof-theoretic aspects of modal logic with fixed points
- Entrepreneur's Thursday 15. Mrz 2012 um 18:30 Uhr, Haus der Universitt
- Primitive Recursive Selection Functions for Existential Assertions over Abstract Algebras
- e-Diss@UNI BERN Declaration of Consent
- Erasmus vorbereitende Besuche (Preparatory Visits = PV) Zur Vorbereitung einer zuknftigen Erasmus-Kooperation knnen Hochschulen besucht werden, mit
- MERGING RULE-BASED BELIEF DATABASES Ricardo Wehbe
- Einige Aspekte der Modallogik S5n mit Allgemeinwissen
- Corrigendum of "Determinacy of Wadge classes and subsystems of second order arithmetic"
- A Note on the Use of Sum in the Logic of Proofs Roman Kuznets
- Full operational set theory with unbounded existential quantification and power set
- 1 choice in a theory of sets and classes Gerhard Jager Jurg Krahenbuhl
- Theories with self-application and computational complexity
- Seite 1 von 10 Vizerektorat Lehre / Version 2.1 (2012)
- Two interpretations of WKL0 in subsystems of PA
- Lions-type compactness and Rubik actions on the Heisenberg Z. M. Balogh and A. Kristaly
- Patientenerlebnis Gruppenunterricht 1977:Patientenerlebnis Gruppenunterricht 1977: Patientin E.A., 1900Patientin E.A., 1900
- A Formal Model of Data Privacy Phiniki Stouppa and Thomas Studer
- Dependent Choice in Explicit Mathematics
- Center for Cognition, Learning, and Memory Organizational placement
- A benchmark method for the propositional modal logics K, KT, S4
- A Syntactical Treatment of Simultaneous Fixpoints in the Modal -Calculus
- Theories of ordinal strength 20 and 20
- A Syntactic Realization Theorem for Justification Logics
- Deduction Chains for Common Knowledge Mathis Kretz a,1
- PROOF THEORETIC COMPLEXITY G. E. OSTRIN
- Veranstaltungen im Frhjahrssemester 2012 Dienstag, 28. Februar 2012, 18.15 Uhr
- Modal Fixed Point Logics Gerhard JGER 1
- The proof-theoretic analysis of 1 1 transfinite
- Self-Referentiality in Contraction-free Fragments of Modal Logic S4
- Bindung frs Leben: HSG Alumni Alumni-Tag der Universitt Bern
- Realization for Justification Logics via Nested Sequents: Modularity through Embedding
- Master Thesis Proof-theoretic aspects of weak Konig's
- Determinacy and 1 1 transfinite recursion along
- Hochschulstrasse 4 CH-3012 Bern
- A proof-theoretic characterization of the basic feasible functionals
- COMPUTING WITH COMMON KNOWLEDGE Ricardo Wehbe
- Extending the system T0 of explicit mathematics: the limit and Mahlo axioms
- Hochschulstrasse 4 CH-3012 Bern
- The defining power of stratified and hierarchical logic programs
- Das Doktoratsprogramm Gender Studies wird im Rahmen der Graduate School Gender Studies von
- Unser Einfluss auf das Klima Die neuesten Erkenntnisse des IPCC
- Interdisziplinres Zentrum fr Geschlechterforschung IZFG
- Der Alumni-Newsletter der Universitt Bern 2 / 2011 5. Alumni-Tag, der Tag fr unser Netzwerk an der Nacht der Forschung vom 23. September 2011
- Polytime Functions in Two-Sorted Bounded Arithmetic
- Autonomous fixed point progressions and fixed point transfinite recursion
- First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
- The provably terminating operations of the subsystem PETJ of explicit mathematics
- The Modal -Calculus and the Logic of Common Knowledge
- Executive MPA KPM Schanzeneckstrasse 1 Postfach 8573 3001 Bern Tel. 031 631 53 18 Fax 031 631 53 17 info@mpa.unibe.ch www.mpa.unibe.ch Ich mchte mehr ber den Executive MPA erfahren und melde mich fr folgende Veranstaltung
- Determinacy of Infinite Games and Reverse Mathematics
- Charakterisierungen kleiner Komplexitatsklassen mittels geschichteter N-Pradikate
- Erasmus-Dozierendenmobilitt (Staff Mobility for Teaching Assignments = STA) Dozierende der Universitt Bern haben die Mglichkeit, einen Lehrauftrag an einer Erasmus-
- On the proof theory of the modal mu-calculus Thomas Studer
- Deep Sequent Systems for Modal Logic Kai Brunnler
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- An intensional fixed point theory over first order arithmetic
- Iterating operations in admissible set theory without foundation: a further aspect of
- ubmission procedure: Call for Papers
- Admissible closures of polynomial time computable arithmetic
- Soft Linear Set Theory Richard McKinley 1
- Operations, sets and classes Gerhard Jager
- Bern, 14. Februar 2012 Einladung zur Erffnungsveranstaltung des Doktoratsprogramms "Studies in Language and Society"
- Common knowledge does not have the Beth Thomas Studer
- Provable data privacy Kilian Stoffel1 and Thomas Studer2
- Sequent Calculi for the Modal -Calculus over S5 Luca Alberucci
- Kai Brunnler Cut Elimination inside a Deep Inference System for Classical
- Justifications for Common Knowledge Samuel Bucheli --Roman Kuznets --Thomas Studer
- A semantics for str: a calculus with
- A Graphical Editor for OWL Ontologies Masterarbeit
- Klimanderung: Aus der Vergangenheit fr die Zukunft lernen
- Implicit task sequence learning with auditory stimuli Brigitte Weiermann and Beat Meier
- Moving Along the Mental Number Line: Interactions Between Whole-Body Motion and Numerical Cognition
- Weak Konig's Lemma and Extensional Equality
- Canonical proof nets for classical logic Richard McKinley
- Realization of analysis into Explicit Mathematics Sergei Tupailo
- Unfolding feasible arithmetic and weak truth Sebastian Eberhard
- On Kazhdan's Property (T) for the special linear group of holomorphic functions
- Zeit Sporthalle 1 Sporthalle 2 Sporthalle 3 Kleine Halle Turnhalle B Dojo Fechtsaal 16:45-17:55
- Locality for Classical Logic Kai Brunnler
- Description Logic Query Answering with Relational Databases
- Proof nets for Herbrand's Theorem1 RICHARD MCKINLEY2
- Metapredicative Subsystems of Christian Ruede
- Data Privacy for ALC Knowledge Bases Phiniki Stouppa and Thomas Studer
- Interdisziplinres Zentrum fr Geschlechterforschung IZFG
- Weak Systems of Explicit Mathematics Inauguraldissertation
- A Buchholz rule for modal fixed point logics Gerhard Jager and Thomas Studer
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- Probabilistic ABox Reasoning: Preliminary Results
- RELATIONAL REPRESENTATION OF ALN KNOWLEDGE BASES
- PALC: Extending ALC ABoxes with Probabilities
- Determinacy of Wadge classes in the Baire space and simple iteration of inductive
- Admission's Procedure for a PhD candidate Please consult the following links, where you will find important information about the admis-
- Revising Non-Monotonic Rule-Based Belief Ricardo Wehbe
- An Algorithmic Interpretation of a Deep Inference System
- INFINITE GAMES FROM AN INTUITIONISTIC POINT OF VIEW
- Applicative theories on tree ordinal numbers
- Total public announcements David Steiner
- On the proof theory of type two functionals based on primitive recursive operations
- A sequent calculus demonstration of Herbrand's Richard McKinley
- Justified Belief Change Samuel Bucheli
- New criterion for algebraic volume density property S. Kaliman and F. Kutzschebauch
- Basic Feasible Functionals Bounded Arithmetic
- A Theory of Explicit Mathematics Equivalent to Reinhard Kahle1
- The Modal -Calculus Hierarchy over Restricted Classes of Transition Systems
- Lorbeeren fr Helvetia? Als eines der letzten Lnder Europas fhrte die Schweiz das Frauenstimmrecht ein; heute
- Explicit Mathematics with Positive Existential Stratified
- Semesterdaten Master Humanmedizin 2011-2014 1 Semesterdaten Masterstudium Humanmedizin 2012/2013
- Modular Sequent Systems for Modal Logic Kai Brunnler1
- Constructive Foundations for Featherweight Java Thomas Studer
- Elementary Arithmetic G. E. Ostrin
- On the treatment of predicative polymorphism in theories of explicit mathematics
- Proof-theoretic contributions to explicit mathematics
