Isabel Oitavem

Contacts

Departamento de Matemática Centro de Matemática e Aplicações Fundamentais Faculdade de Ciências e Tecnologia Universidade de Lisboa Universidade Nova de Lisboa Address: Quinta da Torre, 2829 516 Caparica or Address: Av. Prof. Gama Pinto 2, 1649 003 Lisboa Room: 22 Room: A2-31 Phone: +351-212 948 388 Phone: +351-217 904 893 Fax: +351-212 948 391 Fax: +351-217 954 288 Email: <isarocha@ptmat.fc.ul.pt>

• Mathematical Logic
• Computational Complexity
• Implicit Characterizations

Journal and conference papers

• Applicative theories for the polynomial hierarchy of time and its levels, Annals of Pure and Applied Logic, to appear (with Reinhard Kahle)
• Monotonicity constraints in characterisations of PSPACE, Journal of Logic and Computation, to appear (with Amir Ben-Amram and Bruno Loff)
• A recursion-theoretic approach to NP, Annals of Pure and Applied Logic 162/8, 2011, pp.661-666.
• An applicative theory for FPH, S. van Bakel, S. Berardi, U. Berger (editors), Classical Logic and Computation, Electronic Proceedings of Theoretical Computer Science, vol.47, 2011, pp.44-56 (with R. Kahle).
• Logspace without bounds, Ralf Schindler (editor), Ways of Proof Theory, Ontos Series in Matematical Logic, Ontos-Verlag, 2010, pp.355-362.
• Recursion schemeta for NC^k, LNCS, Springer-Verlag, 2008, pp.49-63 (with G. Bonfante, R. Kahle and J.-Y. Marion).
• Characterizing Pspace with pointers, Mathematical Logic Quarterly 54, N.3, 2008, pp.317-323.
• Towards an implicit characterization of NC^k, LNCS, vol.4207, Springer-Verlag, 2006, pp.212-224 (with G. Bonfante, R. Kahle and J.-Y. Marion).
• An interpretation of S^1_2 in Sigma^b_1-NIA, Portugaliae Mathematica, 63(4), 2006, pp.427-450 (with G. Ferreira).
• Separating NC along the delta axis, ICC Special issue of Theoretical Computer Science 318, 2004, pp.57-78 (with S. Bellantoni).
• Characterizing NC with tier 0 pointers, Mathematical Logic Quarterly 50, N.1, 2004, pp.9-17.
• A term rewriting characterization of the polyspace functions, Archive for Mathematical Logic 41, 2002, pp.35-47.
• Implicit characterizations of Pspace, LNCS, vol.2183, Springer-Verlag, 2001, pp.170-190.
• New recursive characterizations of the elementary functions and the functions computable in polynomial space, Revista Matemática de la Universidad Complutense de Madrid, vol.10, n.1, 1997, pp.109-125.

Thesis

• Classes of Computational Complexity: Implicit Characterizations - a Study in Mathematical Logic, PhD dissertation, Faculdade de Ciências da Universidade de Lisboa, 2001.
• Três Assuntos de Lógica e Complexidade, Master dissertation, Faculdade de Ciências da Universidade de Lisboa, 1995.

Abstracts

• Monotone schemes within FPSPACE, Proof, Computation, Complexity PCC 2010 International Workshop, Proceedings, K.Brunnler and T. Studer (editors), Technical report IAM-10-001, Universitat Bern.
• Monotonicity conditions over characterizations of Pspace, Logic and theory of algorithms, 4th Conference on Computability in Europe, local proceedings, 2008, p.507 (with Bruno Loff).
• Tree recursion and Pspace, Bulletin of Symbolic Logic 12(2), 2006, p.357.
• Implicit characterizations, Oberwolfach Report 14/2005, pp.804-805.
• A new characterization of NC, Bulletin of Symbolic Logic 9(1), 2003, p.103.
• Implicit characterizations: a uniform approach to PTIME, LSPACE and NC, Bulletin of Symbolic Logic 8(1), 2002, p.152.

Technical Reports

• A. Ben-Amram, B. Loff, I. Oitavem, Monotonicity Constraints in Characterisations of PSPACE, Mathematics Preprints, Pre-2009-023, CMAF, UL, 2009.
• G. Bonfante, R. Kahle, J.-Y. Marion, I. Oitavem, Recursion schemata for NC^k, Mathematics Preprints, Pre-2008-002, CMAF, UL, 2008.
• I. Oitavem, Characterizing Pspace with pointers, Pre-publications 6/2007, DM, FCT-UNL, 2007.
• B. Elbt, R. Kahle, and I. Oitavem (editors), 4th International Workshop on Proof, Computation, Complexity, PCC'05, Conference Reports, DM, FCT-UNL, 2005.

• Jan.10-... --- Functional interpretations of arithmetic and analysis, PTDC/MAT/104716/2008, Fundação para a Ciência e a Tecnologia.
• March 09-... --- Dialogical Foundations of Semantics (DiFoS), LogICCC/0001/2007, Fundação para a Ciência e a Tecnologia and European Science Foundation.
• March 05-Dec. 07 --- Sistemas formais de aritmética e computabilidade, Fundação para a Ciência e a Tecnologia, POCI/MAT/61720/2004.
• Jan.05-Dec.06 --- Teorias de programação para computações com recursos limitados, Programa PESSOA, GRICES-EGIDE.
• International Scientific Network Computability in Europe.

• LCC 2012

• DICE 2012

• Seminar of History and Philosophy of Mathematics

• Computability in Europe 2010

• Logic and Computation Seminar

• Computer Science Logic 2009

• Computability in Europe 2009

• Logic and Computation Seminar

• Computability in Europe 2008

• Days in Logic '08

• Days in Logic '06

• Workshop Proof, Computation, Complexity '05

• Days in Logic 2012, Évora, Portugal, 6-8 February. Slides

• Logic and interactions 2012 - Complexity, Marseille, France, 30 January - 3 February. Slides

• Criptography (PG) - 2nd semester