Full Abstraction for Gamma. - Francisco Hernández Quiroz (ENC, 2004)

Some Assumptions about Problem Solving Method in Turing's Model of Intelligence. - Francisco Hernández Quiroz; Raymundo Morado (Computational Intelligence, 2005)

Some Semantics for a Logical Language for the Game of Dominoes. - Fernando R. Velázquez-Quesada; Francisco Hernández Quiroz (Artificial Intelligence and Applications, 2006)

On the possible Computational Power of the Human Mind - Hector Zenil; Francisco Hernández Quiroz (CoRR, 2006)

A Complete Proof System for a Dynamic Epistemic Logic Based upon Finite pi-Calculus Processes. - Eric Ufferman; Pedro Arturo Góngora; Francisco Hernández Quiroz (Advances in Modal Logic, 2010)

Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of pi-Calculus Processes. - Pedro Arturo Góngora; Eric Ufferman; Francisco Hernández Quiroz (CLIMA, 2010)

Bounded rationality in a dynamic alternate game. - Eduardo Espinosa-Avila; Francisco Hernández Quiroz (TARK, 2013)

Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value. - Santiago Hernández-Orozco; Francisco Hernández Quiroz; Hector Zenil; Wilfried Sieg (CoRR, 2015)

The Limits of Decidable States on Open-Ended Evolution and Emergence. - Hector Zenil; Francisco Hernández Quiroz; Santiago Hernández-Orozco (ALIFE, 2016)

Is there any Real Substance to the Claims for a 'New Computationalism'? - Alberto Hernández-Espinosa; Francisco Hernández Quiroz; Héctor Zenil (CiE, 2017)

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence. - Santiago Hernández-Orozco; Francisco Hernández Quiroz; Hector Zenil (Artif. Life, 2018)

Towards a Formalization of a Framework to Express and Reason about Software Engineering Methods. - Miguel Morales Trujillo; Hanna Oktaba; Francisco Hernández Quiroz; Boris Escalante-Ramírez (Comput. Informatics, 2018)

Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability. - Hector Zenil; Liliana Badillo; Santiago Hernández-Orozco; Francisco Hernández Quiroz (Int. J. Parallel Emergent Distributed Syst., 2019)

Shortening of Proof Length is Elusive for Theorem Provers. - Santiago Hernández-Orozco; Francisco Hernández Quiroz; Hector Zenil; Wilfried Sieg (Parallel Process. Lett., 2020)

Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity. - Vladimir Lemus; Eduardo Acuña; Víctor Zamora; Francisco Hernández Quiroz; Hector Zenil (CoRR, 2021)

Computable model discovery and high-level-programming approximations to algorithmic complexity. - Vladimir Lemus; Eduardo Acuña-Yeomans; Víctor Zamora; Francisco Hernández Quiroz; Hector Zenil (Theor. Comput. Sci., 2022)

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity. - Zoe Leyva-Acosta; Eduardo Acuña-Yeomans; Francisco Hernández Quiroz (Entropy, 2024)