Pedro Sánchez Terraf @ FaMAF

Contact Information

Set Theory [Formal verification of forcing]. Applications of Descriptive Set Theory to Computer Science [Dependable Systems Group].

Universal Algebra, Varieties, Definability [Universal Algebra and Logic Research Group]

[1]	The complexity of bisimilarity on pointmass processes. arXiv e-prints, arXiv:2604.06443 (Apr. 2026). 2604.06443. Joint work with M. S. Moroni. [ bib \| arXiv ]
[2]	The associative-poset point of view on right regular bands. arXiv e-prints, arXiv:2511.05721 (Nov. 2025). 2511.05721. Joint work with J. Kuperman. [ bib \| arXiv ]
[3]	Chain Bounding, the leanest proof of Zorn's lemma, and an illustration of computerized proof formalization. The American Mathematical Monthly, arXiv:2404.11638 (2025). 2404.11638. Joint work with G. L. Incatasciato. [ bib \| DOI \| arXiv \| .pdf ]
[4]	A classification of bisimilarities for general Markov decision processes. Mathematical Structures in Computer Science, 35 (2025). 2401.09273. Joint work with M. S. Moroni. [ bib \| DOI \| arXiv ]
[5]	Definability of band structures on posets. Semigroup Forum, arXiv:2404.07877 (Oct. 2024). 2404.07877. Joint work with J. Kuperman and A. Petrovich. [ bib \| DOI \| arXiv \| http ]
[6]	Set theory at Córdoba. Actas de la Academia Nacional de Ciencias, 16: 61–65 (Jul. 2024). Extended abstract for invited talk at the 40th anniversary of the Center for Research and Studies in Mathematics (Córdoba). [ bib \| .pdf ]
[7]	The formal verification of the ctm approach to forcing. Annals of Pure and Applied Logic, 175 (5) (May 2024). 2210.15609. Joint work with E. Gunther, M. Pagano, and M. Steinberg. [ bib \| DOI \| arXiv \| http ]

Published reviews.

Check here.