Isabel Maria Oitavem Fonseca da Rocha Kahle


AuthID: R-000-6CX

Confirmed Publications: 22



1
TITLE: Numeral completeness of weak theories of arithmetic
AUTHORS: Reinhard Kahle ; Oitavem, Isabel ; Santos, Paulo Guilherme ;
PUBLISHED: 2023, SOURCE: JOURNAL OF LOGIC AND COMPUTATION
INDEXED IN: WOS CrossRef
IN MY: ORCID
2
TITLE: Implicit recursion-theoretic characterizations of counting classes  Full Text
AUTHORS: Dal Lago, Ugo; Reinhard Kahle ; Oitavem, Isabel ;
PUBLISHED: 2022, SOURCE: ARCHIVE FOR MATHEMATICAL LOGIC, VOLUME: 61, ISSUE: 7-8
INDEXED IN: Scopus WOS DBLP CrossRef
3
TITLE: The polynomial hierarchy of functions and its levels  Full Text
AUTHORS: Oitavem, I ;
PUBLISHED: 2022, SOURCE: THEORETICAL COMPUTER SCIENCE, VOLUME: 900
INDEXED IN: Scopus WOS CrossRef: 1
IN MY: ORCID
4
TITLE: A Recursion-Theoretic Characterization of the Probabilistic Class PP
AUTHORS: Ugo Dal Lago; Reinhard Kahle ; Isabel Oitavem ;
PUBLISHED: 2021, SOURCE: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia., VOLUME: 202
INDEXED IN: Scopus DBLP Handle
5
TITLE: Lorenzen Between Gentzen and Schütte
AUTHORS: Reinhard Kahle ; Isabel Oitavem ;
PUBLISHED: 2021, SOURCE: Logic, Epistemology, and the Unity of Science, VOLUME: 51
INDEXED IN: Scopus CrossRef Unpaywall
IN MY: ORCID
6
TITLE: A recursion-theoretic characterisation of the positive polynomial-time functions
AUTHORS: Das, A; Oitavem, I ;
PUBLISHED: 2018, SOURCE: 27th Annual EACSL Conference Computer Science Logic, CSL 2018 in Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 119
INDEXED IN: Scopus
IN MY: ORCID
7
TITLE: What is Hilbert's 24th Problem?  Full Text
AUTHORS: Reinhard Kahle ; Isabel Oitavem ;
PUBLISHED: 2018, SOURCE: KAIROS-JOURNAL OF PHILOSOPHY & SCIENCE, VOLUME: 20, ISSUE: 1
INDEXED IN: WOS CrossRef: 2
IN MY: ORCID
8
TITLE: Two function algebras defining functions in NCk boolean circuits  Full Text
AUTHORS: Bonfante, G; Reinhard Kahle ; Marion, JY; Oitavem, I ;
PUBLISHED: 2016, SOURCE: 4th Workshop on Developments in Implicit Computational Complexity in INFORMATION AND COMPUTATION, VOLUME: 248
INDEXED IN: Scopus WOS DBLP CrossRef: 2
IN MY: ORCID
9
TITLE: Applicative theories for the polynomial hierarchy of time and its levels  Full Text
AUTHORS: Reinhard Kahle ; Oitavem, I ;
PUBLISHED: 2013, SOURCE: Meeting on 3rd Classical Logic and Computation (CLAC) in ANNALS OF PURE AND APPLIED LOGIC, VOLUME: 164, ISSUE: 6
INDEXED IN: Scopus WOS DBLP CrossRef: 2
IN MY: ORCID | ResearcherID
10
TITLE: From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace
AUTHORS: Oitavem, I ;
PUBLISHED: 2013, SOURCE: 22nd Annual Conference of the European Association for Computer Science Logic EACSL, CSL 2013 in Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 23
INDEXED IN: Scopus
IN MY: ORCID
Page 1 of 3. Total results: 22.

footer slogan

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service