Francisco A. Doria

According to our database, Francisco A. Doria authored at least 21 papers between 1991 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

Learning the undecidable from networked systems.

Felipe S. Abrahão, Itala M. Loffredo D'Ottaviano, Klaus Wehmuth, Francisco Antonio Doria, Artur Ziviani

CoRR, 2019

2016

A Beautiful Theorem.

Francisco Antonio Doria, Carlos Alberto Nunes Cosenza

Proceedings of the Towards Paraconsistent Engineering, 2016

2015

Hierarchy Models for the Organization of Economic Spaces.

Carlos Alberto Nunes Cosenza, Francisco Antonio Doria, Leonardo Antonio Monteiro Pessôa

Proceedings of the Third International Conference on Information Technology and Quantitative Management, 2015

2012

Using fuzzy NPV evaluation to justify the acquisition of business interruption insurance.

Armando Celestino Gonçalves Neto, Lino Guimarães Marujo, Carlos Alberto Nunes Cosenza, Francisco Antônio de Moraes Accioli Dória, J. M. Lima Jr.

Expert Syst. Appl., 2012

2009

How to build a hypercomputer.

Newton C. A. da Costa, Francisco A. Doria

Appl. Math. Comput., 2009

2007

Informal versus formal mathematics.

Francisco A. Doria

Synth., 2007

Fast-Growing Functions and the <i>P vs. NP</i> Question.

Francisco A. Doria

Log. J. IGPL, 2007

On the metamathematics of the P vs. NP question.

Newton C. A. da Costa, Francisco A. Doria, Eric Bir

Appl. Math. Comput., 2007

2006

Introduction to the special issue on hypercomputation.

Francisco A. Doria, José Félix Costa

Appl. Math. Comput., 2006

Some thoughts on hypercomputation.

Newton C. A. da Costa, Francisco A. Doria

Appl. Math. Comput., 2006

Addendum to "Consequences of an exotic formulation for P.

Newton C. A. da Costa, Francisco A. Doria

Appl. Math. Comput., 2006

2003

Consequences of an exotic definition for P=NP.

Newton C. A. da Costa, Francisco A. Doria

Appl. Math. Comput., 2003

2000

Is There A Simple, Pedestrian Arithmetic Sentence Which Is Independent Of Zfc?

Francisco A. Doria

Synth., 2000

1998

The Incompleteness of Theories of Games.

Marcelo Tsuji, Newton C. A. da Costa, Francisco A. Doria

J. Philos. Log., 1998

On the existence of certain total recursive functions in nontrivial axiom systems, I

Newton C. A. da Costa, Francisco A. Doria

CoRR, 1998

1996

H-Computation (Abstract).

Newton C. A. da Costa, Francisco A. Doria

Proceedings of the Advances in Artificial Intelligence, 1996

1995

On Jaskowski's discussive logic.

Newton C. A. da Costa, Francisco A. Doria

Stud Logica, 1995

Undecidability, incompleteness and the Arnol'd problems.

Newton C. A. da Costa, Francisco A. Doria

Stud Logica, 1995

Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications.

Newton C. A. da Costa, Francisco A. Doria

Complex., 1995

1993

On Arnold's Hilbert Symposium Problems.

Newton C. A. da Costa, Francisco A. Doria

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1991

Meinong's Theory of Objects and Hilbert's epsilon-Symbol.

Newton C. A. da Costa, Francisco A. Doria, N. Papavero

Reports Math. Log., 1991