Fernando Ferreira

Orcid: 0000-0002-8693-7210

Affiliations:
  • University of Lisbon, Faculty of Mathematics, Portugal
  • Pennsylvania State University, Department of Mathematics, University Park, PA, USA (PhD 1988)


According to our database1, Fernando Ferreira authored at least 37 papers between 1994 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The abstract type of the real numbers.
Arch. Math. Log., 2021

On False Heine/Borel Compactness Principles in Proof Mining.
Proceedings of the Connecting with Computability, 2021

2020
Bounds for Indexes of Nilpotency in Commutative Ring Theory: a Proof Mining Approach.
Bull. Symb. Log., 2020

The FAN principle and weak König's lemma in herbrandized second-order arithmetic.
Ann. Pure Appl. Log., 2020

2017
Interpreting weak Kőnig's lemma in theories of nonstandard arithmetic.
Math. Log. Q., 2017

A herbrandized functional interpretation of classical first-order logic.
Arch. Math. Log., 2017

2015
The Faithfulness of Fat: A Proof-Theoretic Proof.
Stud Logica, 2015

The Finitistic Consistency of Heck's Predicative Fregean System.
Notre Dame J. Formal Log., 2015

Computability in Europe 2010.
J. Log. Comput., 2015

Nonstandardness and the bounded functional interpretation.
Ann. Pure Appl. Log., 2015

2014
A New Computation of the σ-Ordinal of KP<sub>ω</sub>.
J. Symb. Log., 2014

2013
Atomic polymorphism.
J. Symb. Log., 2013

Interpretability in Robinson's Q.
Bull. Symb. Log., 2013

2012
Programs, Proofs, Processes.
Theory Comput. Syst., 2012

Computability in Europe 2010.
Ann. Pure Appl. Log., 2012

A Short Note on Spector's Proof of Consistency of Analysis.
Proceedings of the How the World Computes, 2012

2010
The bounded functional interpretation of the double negation shift.
J. Symb. Log., 2010

2009
Commuting Conversions vs. the Standard Conversions of the "Good" Connectives.
Stud Logica, 2009

Injecting uniformities into Peano arithmetic.
Ann. Pure Appl. Log., 2009

2008
The Riemann Integral in Weak Systems of Analysis.
J. Univers. Comput. Sci., 2008

Harrington's conservation theorem redone.
Arch. Math. Log., 2008

2007
Bounded functional interpretation and feasible analysis.
Ann. Pure Appl. Log., 2007

2006
Counting as integration in feasible analysis.
Math. Log. Q., 2006

Bounded modified realizability.
J. Symb. Log., 2006

Comments on Predicative Logic.
J. Philos. Log., 2006

2005
Amending Frege's <i>Grundgesetze der Arithmetik</i>.
Synth., 2005

A Simple Proof of Parsons' Theorem.
Notre Dame J. Formal Log., 2005

Bounded functional interpretation.
Ann. Pure Appl. Log., 2005

2002
Groundwork for Weak Analysis.
J. Symb. Log., 2002

On the Consistency of the Δ<sup>1</sup><sub>1</sub>-CA Fragment of Frege's <i>Grundgesetze</i>.
J. Philos. Log., 2002

1999
Two General Results on Intuitionistic Bounded Theories.
Math. Log. Q., 1999

A Note on Finiteness in the Predicative Foundations of Arithmetic.
J. Philos. Log., 1999

1998
Extracting Algorithms from Intuitionistic Proofs.
Math. Log. Q., 1998

1996
On End-Extensions of Models of ¬exp.
Math. Log. Q., 1996

1995
What are the forall Sigma<sup>b</sup><sub>1</sub>-Consequences of T<sup>1</sup><sub>2</sub> and T<sup>2</sup><sub>2</sub>?
Ann. Pure Appl. Log., 1995

1994
A Feasible Theory for Analysis.
J. Symb. Log., 1994

Binary models generated by their tally part.
Arch. Math. Log., 1994


  Loading...