@article {1902,
title = {From Mathesis Universalis to fixed points and related set-theoretic concepts},
year = {Submitted},
url = {http://www.iam.unibe.ch/ltgpub/2018/jast18.pdf},
author = {Gerhard J{\"a}ger and Silvia Steila}
}
@article {1833,
title = {About some fixed point axioms and related principles in Kripke-Platek environments},
journal = {The Journal of Symbolic Logic},
volume = {83},
year = {2018},
pages = {642-668},
abstract = {Starting point of this article are fixed point axioms for set-bounded
monotone Σ_1 definable operators in the context of Kripke-Platek set
theory KP. We analyze their relationship to other principles such as
maximal iterations, bounded proper injections, and Σ_1 subset-bounded
sparation. One of our main results states that in KP + (V =L) all these
principles are equivalent to Σ_1 separation.},
url = {http://www.iam.unibe.ch/ltgpub/2017/jast17.pdf},
author = {Gerhard J{\"a}ger and Silvia Steila}
}
@inbook {1850,
title = {The Operational Penumbra: Some Ontological Aspects},
booktitle = {Feferman on Foundations - Logic, Mathematics, Philosophy},
volume = {13},
year = {2018},
publisher = {Springer International Publishing},
organization = {Springer International Publishing},
url = {http://www.iam.unibe.ch/ltgpub/2018/jae18.pdf},
author = {Gerhard J{\"a}ger}
}
@article {1812,
title = {Truncation and Semi-Decidability Notions in Applicative Theories},
journal = {The Journal of Symbolic Logic},
volume = {83},
year = {2018},
pages = {967-990},
abstract = {BON+ is an applicative theory and closely related to the first order parts of
the standard systems of explicit mathematics. As such it is also a natural framework
for abstract computations. In this article we analyze this aspect of BON+ more closely.
First a point is made for introducing a new operation τN , called truncation, to obtain a
natural formalization of partial recursive functions in our applicative framework. Then we
introduce the operational versions of a series of notions that are all equivalent to semi-
decidability in ordinary recursion theory on the natural numbers, and study their mutual
relationships over BON+ with τN .},
doi = {10.7892/boris.125568},
url = {http://www.iam.unibe.ch/ltgpub/2016/jarosa16.pdf},
author = {Gerhard J{\"a}ger and Timtej Rosebrock and Kentaro Sato}
}
@inbook {1779,
title = {Unfolding schematic systems},
booktitle = {Feferman on Foundations - Logic, Mathematics, Philosophy},
year = {2018},
publisher = {Springer},
organization = {Springer},
url = {http://www.iam.unibe.ch/ltgpub/2016/str16.pdf},
author = {Thomas Strahm},
editor = {Gerhard J{\"a}ger and Wilfried Sieg}
}
@book {1900,
title = {Feferman on Foundations: Logic, Mathematics, Philosophy},
series = {Outstanding Contributions to Logic},
number = {13},
year = {2017},
publisher = {Springer International Publishing},
organization = {Springer International Publishing},
isbn = {9783319633329},
editor = {J{\"a}ger, G. and Sieg, W.}
}
@conference {1847,
title = {The Strength of the SCT Criterion},
booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
year = {2017},
pages = {260-273},
doi = {10.1007/978-3-319-55911-7_19},
url = {http://www.iam.unibe.ch/ltgpub/2017/fsy17.pdf},
author = {Emanuele Frittaion and Silvia Steila and Keita Yokoyama},
editor = {T. V. Gopal and Gerhard J{\"a}ger and Silvia Steila}
}
@book {1851,
title = {Theory and Applications of Models of Computation TAMC 2017},
series = {Lecture Notes in Computer Science},
volume = {10185},
year = {2017},
publisher = {Springer International Publishing},
organization = {Springer International Publishing},
address = {Cham},
url = {http://boris.unibe.ch/104849/},
editor = {T.V. Gopal and Gerhard J{\"a}ger and Silvia Steila}
}
@conference {1777,
title = {A canonical model construction for intuitionistic distributed knowledge},
booktitle = {Advances in Modal Logic 2016},
year = {2016},
publisher = {College Publications},
organization = {College Publications},
url = {http://www.iam.unibe.ch/ltgpub/2016/jmidk16.pdf},
author = {Gerhard J{\"a}ger and Michel Marti},
editor = {Lev Beklemishev and S. Demri and A. M{\'a}t{\'e}}
}
@article {1731,
title = {Intuitionistic common knowledge or belief},
journal = {Journal of Applied Logic},
volume = {18},
year = {2016},
chapter = {150},
abstract = {Starting off from the usual language of modal logic for multi-agent systems dealing with the agents{\textquoteright} knowledge/belief and common knowledge/belief we define so-called epistemic Kripke structures for intuitionistic (common) knowledge/belief. Then we introduce corresponding deductive systems and show that they are sound and complete with respect to these semantics.},
keywords = {Canonical models, Common knowledge, Intuitionistic modal logic},
doi = {10.7892/boris.71315},
url = {http://www.iam.unibe.ch/ltgpub/2015/jmick15.pdf},
author = {Gerhard J{\"a}ger and Michel Marti}
}
@article {1753,
title = {Relativizing operational set theory},
journal = {The Bulletin of Symbolic Logic},
volume = {22},
year = {2016},
month = {09},
pages = {332-352},
abstract = {We introduce a way of relativizing operational set theory that also
takes care of application. After presenting the basic approach and
proving some essential properties of this new form of relativization we
turn to the notion of relativized regularity and to the system OST(LR)
that extends OST by a limit axiom claiming that any set is element
of a relativized regular set. Finally we show that OST(LR) is proof-
theoretically equivalent to the well-known theory KPi for a recursively
inaccessible universe.
},
issn = {1079-8986},
url = {http://www.iam.unibe.ch/ltgpub/2015/jae15.pdf},
author = {Gerhard J{\"a}ger}
}
@inbook {bjs15,
title = {Theories of proof-theoretic strength $\psi$($\Gamma_{\Omega+1}$)},
booktitle = {Concepts of Proof in Mathematics, Philosophy, and Computer Science},
series = {Ontos Mathematical Logic},
volume = {6},
year = {2016},
month = {January},
publisher = {De Gruyter},
organization = {De Gruyter},
isbn = {978-1-5015-0263-7},
url = {http://www.iam.unibe.ch/ltgpub/2015/bjs15.pdf},
author = {Ulrik Torben Buchholtz and Gerhard J{\"a}ger and Thomas Strahm},
editor = {Dieter Probst and Peter Schuster}
}
@inbook {jp13,
title = {A proof-theoretic analysis of theories for stratified inductive definitions},
booktitle = {Gentzen{\textquoteright}s Centenary: The Quest for Consistency},
year = {2015},
note = {2014},
publisher = {Springer},
organization = {Springer},
doi = {10.1007/978-3-319-10103-3},
url = {http://www.iam.unibe.ch/ltgpub/2013/jp13.pdf},
author = {Gerhard J{\"a}ger and Dieter Probst},
editor = {Reinhard Kahle and Michael Rathjen}
}
@article {jz14,
title = {Explicit mathematics and operational set theory: some ontological comparisons},
journal = {The Bulletin of Symbolic Logic},
volume = {20},
year = {2014},
month = {9},
pages = {275-292},
issn = {1943-5894},
doi = {10.1017/bsl.2014.21},
url = {http://www.iam.unibe.ch/ltgpub/2014/jz14.pdf},
author = {Gerhard J{\"a}ger and Rico Zumbrunnen}
}
@article {jae13,
title = {Operational closure and stability},
journal = {Annals of Pure and Applied Logic},
volume = {164},
number = {7{\textendash}8},
year = {2013},
pages = {813-821},
abstract = {In this article we introduce and study the notion of operational closure: a transitive set d is called operationally closed iff it contains all constants of $\mathsf{OST}$ and any operation $f\in d$ applied to an element $a\in d$ yields an element $fa\in d$ , provided that $f$ applied to a has a value at all. We will show that there is a direct relationship between operational closure and stability in the sense that operationally closed sets behave like $\Sigma_1$ substructures of the universe. This leads to our final result that $\mathsf{OST}$ plus the axiom $(\mathsf{OLim})$ , claiming that any set is element of an operationally closed set, is proof-theoretically equivalent to the system $\mathsf{KP}+(\Sigma_1\text{-}\mathsf{Sep})$ of Kripke-Platek set theory with infinity and $\Sigma_1$ separation. We also characterize the system $\mathsf{OST}$ plus the existence of one operationally closed set in terms of Kripke-Platek set theory with infinity and a parameter-free version of $\Sigma_1$ separation.},
issn = {0168-0072},
doi = {http://dx.doi.org/10.1016/j.apal.2013.01.004},
url = {http://www.iam.unibe.ch/ltgpub/2013/jae13.pdf},
author = {Gerhard J{\"a}ger}
}
@conference {1307,
title = {About the Strength of Operational Regularity},
booktitle = {Logic, Construction, Computation},
year = {2012},
pages = {305-324},
publisher = {Ontos Verlag},
organization = {Ontos Verlag},
url = {http://www.iam.unibe.ch/ltgpub/2012/jz12.pdf},
author = {Gerhard J{\"a}ger and Rico Zumbrunnen},
editor = {Ulrich Berger and Hannes Diener and Peter Schuster and Monika Seisenberger}
}
@article {1319,
title = {A Buchholz rule for modal fixed point logics},
journal = {Logica Universalis},
volume = {5},
year = {2011},
note = {To appear, 2010},
pages = {1-19},
doi = {10.1007/s11787-010-0022-1},
url = {http://www.iam.unibe.ch/ltgpub/2011/js11.pdf},
author = {Gerhard J{\"a}ger and Thomas Studer}
}
@article {1316,
title = {The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories},
journal = {Annals of Pure and Applied logic},
volume = {162},
year = {2011},
month = {2011},
pages = {647-660},
keywords = {Suslin operator in applicative theories},
doi = {10.1016/j.apal.2011.01.009},
url = {http://www.iam.unibe.ch/ltgpub/2011/jp11.pdf},
author = {Gerhard J{\"a}ger and Dieter Probst}
}
@conference {1332,
title = {Modal Fixed Point Logics},
booktitle = {Logics and Languages for Reliability and Security},
series = {NATO Science for Peace and Security Series - D: Information and Communication Security},
volume = {25},
year = {2010},
publisher = {IOS Press},
organization = {IOS Press},
doi = {10.3233/978-1-60750-100-8-129},
url = {http://www.iam.unibe.ch/ltgpub/2010/jae10.pdf},
author = {Gerhard J{\"a}ger},
editor = {J. Esparza and B. Spanfelner and O. Grumberg}
}
@conference {1329,
title = {$Σ^1_1$ choice in a theory of sets and classes},
booktitle = {Ways of Proof Theory},
year = {2010},
pages = {283-314},
publisher = {Ontos Verlag},
organization = {Ontos Verlag},
url = {http://www.iam.unibe.ch/ltgpub/2010/jk10.pdf},
author = {Gerhard J{\"a}ger and Kr{\"a}henb{\"u}hl, J{\"u}rg},
editor = {Ralf Schindler}
}
@article {1363,
title = {Full operational set theory with unbounded existential quantification and power set},
journal = {Annals of Pure and Applied Logic},
volume = {160},
year = {2009},
pages = {33-52},
url = {http://www.iam.unibe.ch/ltgpub/2009/jae09a.pdf},
author = {Gerhard J{\"a}ger}
}
@conference {1365,
title = {Operations, sets and classes},
booktitle = {Logic, Methodology and Philosophy of Science - Proceedings of the Thirteenth International Congress},
year = {2009},
publisher = {College Publications},
organization = {College Publications},
url = {http://www.iam.unibe.ch/ltgpub/2009/jae09b.pdf},
author = {Gerhard J{\"a}ger},
editor = {C. Glymour and W. Wei and D. Westerstahl}
}
@article {1367,
title = {Canonical completeness of infinitary mu},
journal = {Journal of Logic and Algebraic Programming},
volume = {76},
year = {2008},
pages = {270-292},
doi = {10.1016/j.jlap.2008.02.005},
url = {http://www.iam.unibe.ch/ltgpub/2008/jks08.pdf},
author = {Gerhard J{\"a}ger and Mathis Kretz and Thomas Studer}
}
@article {1379,
title = {Cut-free common knowledge},
journal = {Journal of Applied Logic},
volume = {5},
year = {2007},
pages = {681-689},
doi = {10.1016/j.jal.2006.02.003},
url = {http://www.iam.unibe.ch/ltgpub/2007/jks07.pdf},
author = {Gerhard J{\"a}ger and Mathis Kretz and Thomas Studer}
}
@article {1381,
title = {On Feferman{\textquoteright}s operational set theory $\mathsf{OST}$},
journal = {Annals of Pure and Applied Logic},
volume = {150},
year = {2007},
pages = {19-39},
url = {http://www.iam.unibe.ch/ltgpub/2007/jae07.pdf},
author = {Gerhard J{\"a}ger}
}
@article {1403,
title = {About cut elimination for logics of common knowledge},
journal = {Annals of Pure and Applied Logic},
volume = {133},
year = {2005},
pages = {73-99},
doi = {10.1016/j.apal.2004.10.004},
url = {http://www.iam.unibe.ch/ltgpub/2005/aj05.pdf},
author = {Luca Alberucci and Gerhard J{\"a}ger}
}
@conference {1409,
title = {Cut-free axiomatizations for stratified modal fixed point logic},
booktitle = {Proceedings of Methods for Modalities 4},
series = {Humboldt-Universit{\"a}t Berlin Informatik-Berichte},
volume = {194},
year = {2005},
pages = {125-143},
publisher = {Humboldt-Universit{\"a}t Berlin},
organization = {Humboldt-Universit{\"a}t Berlin},
url = {http://www.iam.unibe.ch/ltgpub/2005/jks05.pdf},
author = {Gerhard J{\"a}ger and Mathis Kretz and Thomas Studer},
editor = {Holger Schlingloff}
}
@conference {1412,
title = {Metapredicative and explicit Mahlo: a proof-theoretic perspective},
booktitle = {Proceedings of Logic Colloquium {\textquoteright}00},
series = {Association of Symbolic Logic Lecture Notes in Logic},
volume = {19},
year = {2005},
pages = {272-293},
publisher = {AK Peters},
organization = {AK Peters},
url = {http://www.iam.unibe.ch/ltgpub/2005/jae05.pdf},
author = {Gerhard J{\"a}ger},
editor = {Rene Cori and Alexander Razborov and Stevo Todorcevic and Carol Wood}
}
@article {1417,
title = {Reflections on reflections in explicit mathematics},
journal = {Annals of Pure and Applied Logic},
volume = {136},
year = {2005},
pages = {116-133},
url = {http://www.iam.unibe.ch/ltgpub/2005/js05.pdf},
author = {Gerhard J{\"a}ger and Thomas Strahm}
}
@article {1421,
title = {An intensional fixed point theory over first order arithmetic},
journal = {Annals of Pure and Applied Logic},
volume = {128},
year = {2004},
pages = {197-213},
url = {http://www.iam.unibe.ch/ltgpub/2004/jae04.pdf},
author = {Gerhard J{\"a}ger}
}
@conference {1418,
title = {Iterating $Σ$ operations in admissible set theory without foundation: a further aspect of metapredicative Mahlo},
booktitle = {One Hundred Years of Russell{\textquoteright}s Paradox. Papers from the 2001 Munich Russell Conference},
year = {2004},
pages = {119-134},
publisher = {de Gruyter},
organization = {de Gruyter},
url = {http://www.iam.unibe.ch/ltgpub/2004/jp04a.pdf},
author = {Gerhard J{\"a}ger and Dieter Probst},
editor = {Godehart Link}
}
@article {1423,
title = {Variation on a theme of Sch{\"u}tte},
journal = {Mathematical Logic Quarterly},
volume = {50},
year = {2004},
pages = {258-264},
url = {http://www.iam.unibe.ch/ltgpub/2004/jp04b.pdf},
author = {Gerhard J{\"a}ger and Dieter Probst}
}
@article {1429,
title = {Extending the system $\mathsf{T}_0$ of explicit mathematics: the limit and Mahlo axioms},
journal = {Annals of Pure and Applied Logic},
volume = {114},
year = {2002},
pages = {79-101},
url = {http://www.iam.unibe.ch/ltgpub/2002/js02b.pdf},
author = {Gerhard J{\"a}ger and Thomas Studer}
}
@conference {1434,
title = {The proof-theoretic analysis of the Suslin operator in applicative theories},
booktitle = {Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman},
year = {2002},
pages = {270-292},
publisher = {AK Peters},
organization = {AK Peters},
url = {http://www.iam.unibe.ch/ltgpub/2002/js02a.pdf},
author = {Gerhard J{\"a}ger and Thomas Strahm},
editor = {Wilfried Sieg and Richard Sommer and Carolyn Talcott}
}
@article {1446,
title = {First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo},
journal = {The Journal of Symbolic Logic},
volume = {66},
year = {2001},
pages = {1073-1089},
url = {http://www.iam.unibe.ch/ltgpub/2001/jae01.pdf},
author = {Gerhard J{\"a}ger}
}
@article {1450,
title = {Universes in explicit mathematics},
journal = {Annals of Pure and Applied Logic},
volume = {109},
year = {2001},
pages = {141-162},
url = {http://www.iam.unibe.ch/ltgpub/2001/jks01.pdf},
author = {Gerhard J{\"a}ger and Reinhard Kahle and Thomas Studer}
}
@article {1451,
title = {Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory},
journal = {The Journal of Symbolic Logic},
volume = {66},
year = {2001},
pages = {935-958},
url = {http://www.iam.unibe.ch/ltgpub/2001/js01.pdf},
author = {Gerhard J{\"a}ger and Thomas Strahm}
}
@article {1460,
title = {Fixed point theories and dependent choice},
journal = {Archive for Mathematical Logic},
volume = {39},
year = {2000},
pages = {493-508},
url = {http://www.iam.unibe.ch/ltgpub/2000/js00.ps},
author = {Gerhard J{\"a}ger and Thomas Strahm}
}
@article {1462,
title = {Bar induction and $\omega$ model reflection},
journal = {Annals of Pure and Applied Logic},
volume = {97},
year = {1999},
pages = {221-230},
url = {http://www.iam.unibe.ch/ltgpub/1999/js99.ps},
author = {Gerhard J{\"a}ger and Thomas Strahm}
}
@conference {1469,
title = {On applicative theories},
booktitle = {Logic and Foundations of Mathematics},
year = {1999},
pages = {83-92},
publisher = {Kluwer},
organization = {Kluwer},
url = {http://www.iam.unibe.ch/ltgpub/1999/jks99.ps},
author = {Gerhard J{\"a}ger and Reinhard Kahle and Thomas Strahm},
editor = {Andrea Cantini and Ettore Casari and Pierluigi Minari}
}
@article {1473,
title = {The proof-theoretic analysis of transfinitely iterated fixed point theories},
journal = {The Journal of Symbolic Logic},
volume = {64},
year = {1999},
pages = {53-67},
url = {http://www.iam.unibe.ch/ltgpub/1999/jkss99.ps},
author = {Gerhard J{\"a}ger and Reinhard Kahle and Anton Setzer and Thomas Strahm}
}
@conference {1476,
title = {A proof-theoretic framework for logic programming},
booktitle = {Handbook of Proof Theory},
year = {1998},
pages = {639-682},
publisher = {North-Holland},
organization = {North-Holland},
doi = {10.1016/S0049-237X(98)80024-4},
url = {http://dx.doi.org/10.1016/S0049-237X(98)80024-4},
author = {Gerhard J{\"a}ger and Robert F. St{\"a}rk},
editor = {Samuel S. Buss}
}
@article {1492,
title = {Power types in explicit mathematics?},
journal = {The Journal of Symbolic Logic},
volume = {62},
year = {1997},
pages = {1142-1146},
url = {http://www.jstor.org/stable/2275630},
author = {Gerhard J{\"a}ger}
}
@conference {1488,
title = {Some proof theory of first order logic programming},
booktitle = {Logic of Computation},
series = {NATO Science Series},
volume = {157},
year = {1997},
pages = {201-228},
publisher = {Springer},
organization = {Springer},
author = {Gerhard J{\"a}ger},
editor = {Helmut Schwichtenberg}
}
@article {1502,
title = {A logics workbench},
journal = {The European Journal on Artificial Intelligence},
volume = {9},
year = {1996},
pages = {53-58},
author = {Alain Heuerding and Gerhard J{\"a}ger and Stefan Schwendimann and Michael Seyfried}
}
@article {1496,
title = {Some theories with positive induction of ordinal strength $\varphi \omega 0$},
journal = {The Journal of Symbolic Logic},
volume = {61},
year = {1996},
pages = {818-842},
url = {http://www.iam.unibe.ch/ltgpub/1996/js96.ps},
author = {Gerhard J{\"a}ger and Thomas Strahm}
}
@article {1498,
title = {Systems of explicit mathematics with non-constructive $μ$-operator. Part II},
journal = {Annals of Pure and Applied Logic},
volume = {79},
year = {1996},
pages = {37-52},
doi = {10.1016/0168-0072(95)00028-3},
url = {http://dx.doi.org/10.1016/0168-0072(95)00028-3},
author = {Solomon Feferman and Gerhard J{\"a}ger}
}
@article {1503,
title = {The logics workbench LWB: a snapshot},
journal = {Euromath Bulletin},
volume = {2},
year = {1996},
pages = {177-186},
url = {http://www.iam.unibe.ch/ltgpub/1996/hjss96b.ps},
author = {Alain Heuerding and Gerhard J{\"a}ger and Stefan Schwendimann and Michael Seyfried}
}
@conference {1508,
title = {A deductive approach to logic programming},
booktitle = {Proof and Computation},
series = {NATO ASI Series F},
volume = {139},
year = {1995},
pages = {231-270},
publisher = {Springer},
organization = {Springer},
author = {Gerhard J{\"a}ger},
editor = {Helmut Schwichtenberg}
}
@conference {1513,
title = {LWB - a logics workbench, extended abstract},
booktitle = {Proceedings of KI-95 Activities: Workshop, Posters, Demos},
year = {1995},
pages = {73-74},
publisher = {Gesellschaft f{\"u}r Informatik},
organization = {Gesellschaft f{\"u}r Informatik},
author = {Alain Heuerding and Gerhard J{\"a}ger and Stefan Schwendimann and Michael Seyfried},
editor = {L. Dreschler-Fischer and S. Pribbenow}
}
@conference {1509,
title = {Propositional logics on the computer},
booktitle = {Proceedings of Theorem Proving with Analytic Tableaux and Related Methods},
series = {Lecture Notes in Computer Science},
volume = {918},
year = {1995},
pages = {310-323},
publisher = {Springer},
organization = {Springer},
url = {http://www.iam.unibe.ch/ltgpub/1995/hjss95a.ps},
author = {Alain Heuerding and Gerhard J{\"a}ger and Stefan Schwendimann and Michael Seyfried},
editor = {Peter Baumgartner and Reiner H{\"a}hnle and Joachim Posegga}
}
@article {1511,
title = {Second order theories with ordinals and elementary comprehension},
journal = {Archive for Mathematical Logic},
volume = {34},
year = {1995},
pages = {345-375},
url = {http://www.iam.unibe.ch/ltgpub/1995/js95a.ps},
author = {Gerhard J{\"a}ger and Thomas Strahm}
}
@article {1512,
title = {Totality in applicative theories},
journal = {Annals of Pure and Applied Logic},
volume = {74},
year = {1995},
pages = {105-120},
url = {http://www.iam.unibe.ch/ltgpub/1995/js95b.ps},
author = {Gerhard J{\"a}ger and Thomas Strahm}
}
@article {1514,
title = {About some symmetries of negation},
journal = {The Journal of Symbolic Logic},
volume = {59},
year = {1994},
pages = {473-485},
url = {http://www.jstor.org/stable/2275401},
author = {Brigitte H{\"o}sli and Gerhard J{\"a}ger}
}
@conference {1516,
title = {Executable models for analysis and implementation of complex systems},
booktitle = {Proceedings of Information Conference of Swiss Priority Programme Informatics Research 1992{\textendash}1996, Module 1: Secure Distributed Systems},
year = {1994},
author = {B. B{\"u}tler and R. Esser and Gerhard J{\"a}ger and Urs-Martin K{\"u}nzi and Heinz Lienhard and R. Mattmann}
}
@article {1517,
title = {Fixed points in Peano arithmetic with ordinals},
journal = {Annals of Pure and Applied Logic},
volume = {60},
year = {1993},
pages = {119-132},
doi = {10.1016/0168-0072(93)90039-G},
url = {http://dx.doi.org/10.1016/0168-0072(93)90039-G},
author = {Gerhard J{\"a}ger}
}
@conference {1523,
title = {Some proof-theoretic aspects of logic programming},
booktitle = {Logic and Algebra of Specification},
series = {Computer and Systems Sciences},
volume = {94},
year = {1993},
pages = {113-142},
publisher = {Springer},
organization = {Springer},
author = {Gerhard J{\"a}ger},
editor = {Friedrich Ludwig Bauer and Wilfried Brauer and Helmut Schwichtenberg}
}
@article {1518,
title = {Systems of explicit mathematics with non-constructive $μ$-operator. Part I},
journal = {Annals of Pure and Applied Logic},
volume = {65},
year = {1993},
pages = {243-263},
url = {http://www.iam.unibe.ch/ltgpub/1993/fj93.pdf},
author = {Solomon Feferman and Gerhard J{\"a}ger}
}
@conference {1519,
title = {The Basic Logic of Proofs},
booktitle = {Computer Science Logic, 6th Workshop, CSL{\textquoteright}92, San Miniato, Italy, September 28{\textendash}October 2, 1992, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {702},
year = {1993},
pages = {14-28},
publisher = {Springer},
organization = {Springer},
abstract = {Propositional Provability Logic was axiomatized in~[Sol76]. This logic describes the behaviour of the arithmetical operator {\textquoteleft}{\textquoteleft}$y$~is provable{\textquoteright}{\textquoteright}. The aim of the current paper is to provide propositional axiomatizations of the predicate {\textquoteleft}{\textquoteleft}$x$~is a proof of~$y${\textquoteright}{\textquoteright} by means of modal logic, with the intention of meeting some of the needs of computer science.},
doi = {10.1007/3-540-56992-8_3},
author = {Sergei Artemov and Tyko Strassen},
editor = {E. B{\"o}rger and Gerhard J{\"a}ger and Kleine B{\"u}ning, H. and S. Martini and M. M. Richter}
}
@article {1520,
title = {The defining power of stratified and hierarchical logic programs},
journal = {Journal of Logic Programming},
volume = {15},
year = {1993},
pages = {55-77},
url = {http://www.iam.unibe.ch/ltgpub/1993/js93.pdf},
author = {Gerhard J{\"a}ger and Robert F. St{\"a}rk}
}