A structural approach to diophantine definability. - Mihai Prunescu (1999)

P != NP for the Reals with Various Analytic Functions. - Mihai Prunescu (J. Complex., 2001)

Non-effective Quantifier Elimination. - Mihai Prunescu (Math. Log. Q., 2001)

A Model-Theoretic Proof for P unequal to NP over All Infinite Abelian Groups. - Mihai Prunescu (J. Symb. Log., 2002)

An Isomorphism Between Monoids of External Embeddings: About Definability in Arithmetic. - Mihai Prunescu (J. Symb. Log., 2002)

Diophantine properties of finite commutative rings. - Mihai Prunescu (Arch. Math. Log., 2003)

P != NP for all infinite Boolean algebras. - Mihai Prunescu (Math. Log. Q., 2003)

The Symmetric Subset-Sum Problem over the Complex Numbers. - Mihai Prunescu (Algorithmic Algebra and Logic, 2005)

Two situations with unit-cost: ordered abelian semi-groups and some commutative rings. - Mihai Prunescu (J. Complex., 2005)

Fast Quantifier Elimination Means P = NP. - Mihai Prunescu (CiE, 2006)

Structure with fast elimination of quantifiers. - Mihai Prunescu (J. Symb. Log., 2006)

Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions. - Mihai Prunescu (Math. Log. Q., 2006)

An Undecidable Property of Recurrent Double Sequences. - Mihai Prunescu (Notre Dame J. Formal Log., 2008)

Self-similar carpets over finite fields. - Mihai Prunescu (Eur. J. Comb., 2009)

Linear Recurrent Double Sequences with Constant Border in M2(F2) are Classified According to Their Geometric Content. - Mihai Prunescu (Symmetry, 2011)

Fp-affine recurrent n-dimensional sequences over Fq are p-automatic. - Mihai Prunescu (Eur. J. Comb., 2013)

A two-valued recurrent double sequence that is not automatic. - Mihai Prunescu (Theor. Comput. Sci., 2014)

THE EXPONENTIAL DIOPHANTINE PROBLEM FOR ${ mathbb {Q}}$. - Mihai Prunescu (J. Symb. Log., 2020)

Secure Multiparty Computation in arbitrary rings. - Mihai Prunescu (SYNASC, 2021)

Smooth approximations by continuous choice-functions. - Mihai Prunescu (Soft Comput., 2021)

On Representations of Intended Structures in Foundational Theories. - Neil Barton; Moritz Müller; Mihai Prunescu (J. Philos. Log., 2022)

Using Z3 to Verify Inferences in Fragments of Linear Logic. - Alen Docef; Radu Negulescu; Mihai Prunescu (FROM, 2023)

Symmetric Functions over Finite Fields. - Mihai Prunescu (FROM, 2023)

On other two representations of the C-recursive integer sequences by terms in modular arithmetic. - Mihai Prunescu (J. Symb. Comput., 2025)

Computational considerations on the representation of number-theoretic functions by arithmetic terms. - Mihai Prunescu; Lorenzo Sauras Altuzarra (J. Log. Comput., 2025)

A Minimal Substitution Basis for the Kalmar Elementary Functions. - Mihai Prunescu; Lorenzo Sauras Altuzarra; Joseph M. Shunia (CoRR, 2025)

Conjunctions of exponential diophantine equations over ${ mathbb {Q}}$. - Mihai Prunescu (Arch. Math. Log., 2025)