Publications

Export 14 results:

Filters: First Letter Of Title is F [Clear All Filters]

Submitted

S. Eberhard, “A feasible theory of truth over combinatory logic”. Submitted.

K. Sato, “Full and Hat Inductive Definitions Are Equivalent in NBG”. Submitted.

2009

G. Jäger, “Full operational set theory with unbounded existential quantification and power set”, Annals of Pure and Applied Logic, vol. 160, pp. 33–52, 2009.

2007

G. Jäger, “On Feferman's operational set theory $\mathsf OST$”, Annals of Pure and Applied Logic, vol. 150, p. 19{–}39, 2007.

P. Stouppa and T. Studer, “A formal model of data privacy”, in Proceedings of Perspectives of System Informatics, 2007, vol. 4378, p. 401{–}411.

2001

G. Jäger, “First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo”, The Journal of Symbolic Logic, vol. 66, p. 1073{–}1089, 2001.

R. Kahle and T. Studer, “Formalizing non-termination of recursive programs”, Journal of Logic and Algebraic Programming, vol. 49, p. 1{–}14, 2001.

2000

S. Tupailo, “Finitary reductions for local predicativity, I: recursively regular ordinals”, in Proceedings of Logic Colloquium '98, 2000, vol. 13, p. 465{–}499.

G. Jäger and T. Strahm, “Fixed point theories and dependent choice”, Archive for Mathematical Logic, vol. 39, p. 493{–}508, 2000.

1999

T. Strahm, “First steps into metapredicativity in explicit mathematics”, in Sets and Proofs, 1999, vol. 258, p. 383{–}402.

1998

R. Kahle, “Frege structures for partial applicative theories”, Journal of Logic and Computation, vol. 8, p. 683{–}700, 1998.

1996

R. Kahle, “Frege structures for partial applicative theories”. Universität Bern, 1996.

1993

G. Jäger, “Fixed points in Peano arithmetic with ordinals”, Annals of Pure and Applied Logic, vol. 60, p. 119{–}132, 1993.

S. Artemov and T. Strassen, “Functionality in the Basic Logic of Proofs”. Institut für Informatik und angewandte Mathematik, 1993.