Publications

 

  • P. Naumov, B. Nicholls, Rationally Functional Dependence, 10th Conference on Logic and the Foundations of Game and Decision Theory, June 18-20, 2012, University of Sevilla, Spain (to appear)

  • P. Naumov, I. Simonelli, Strict Equilibria Interchangeability in Multi-Player Zero-Sum Games, 10th Conference on Logic and the Foundations of Game and Decision Theory, June 18-20, 2012, University of Sevilla, Spain (to appear)

  • S. Miner More, P. Naumov, Hypergraphs of Multiparty Secrets, Annals of Mathematics and Artificial Intelligence (to appear)

    11th International Workshop on Computational Logic in Multi-Agent Systems, CLIMA XI (Lisbon, Portugal), LNAI 6245, pp. 15-32. Springer, 2010.

  • S. Miner More, P. Naumov, Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy, ACM Transactions on Computational Logic (to appear)

  • S. Miner More, P. Naumov, Logic of Secrets in Collaboration Networks, Annals of Pure and Applied Logic, 162(12):959-969, 2011.

    On Interdependence of Secrets in Collaboration Networks, 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK '09), July 2009, Stanford University, pp. 208-217

  • P. Naumov, B. Nicholls, Game Semantics for the Geiger-Paz-Pearl Axioms of Independence in Proceedings of the Third International Workshop on Logic, Rationality and Interaction (LORI III), Guangzhou (Canton), China, October 2011, LNAI 6953, pp. 220-232, Springer 2011

  • S. Miner More, P. Naumov, B. Sapp, Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence, in 20th Conference on Computer Science Logic (CSL 2011), Bergen, Norway, pp. 443-457, September 2011

  • S. Miner More, P. Naumov, Functional Dependence on Hypergraphs of Multiparty Secrets, in 12th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XII), Barcelona, Spain, July 2011, LNAI 6814, pp. 29-40, Springer 2011

  • S. Miner More, P. Naumov, B. Nicholls, A. Yang, A Ternary Knowledge Relation on Secrets, in Krzysztof R. Apt (Ed.): Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), Groningen, The Netherlands, July 2011. ACM 2011, pp. 46-54

  • M. Donders, S. Miner More, P. Naumov, Information Flow on Directed Acyclic Graphs (full version), in Lev D. Beklemishev, Ruy de Queiroz (Eds.): Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 2011. Proceedings. LNCS 6642 Springer 2011, pp. 95-109

  • R. Kelvey, S. Miner More, Pavel Naumov, and B. Sapp, Independence and Functional Dependence Relations on Secrets, 12th International Conference on the Principles of Knowledge Representation and Reasoning, (KR '10), Toronto, Canada, May 2010, pp. 528-533

  • S. Miner More and Pavel Naumov, An Independence Relation for Sets of Secrets, Studia Logica, v.94(1):73-85, 2010

    16th Workshop on Logic, Language, Information and Computation (WoLLIC '09), Tokyo, Japan, June 2009, pp. 296-304

  • Pavel Naumov, On Meta Complexity of Propositional Formulas and Propositional Proofs, Archive for Mathematical Logic, pp. 35-52, v. 47, n. 1, 2008

    New Directions in Proof Complexity workshop, Isaac Newton Institute for Mathematical Sciences, April 10-13, 2006, Cambridge University, Cambridge, United Kingdom (presented)

  • Pavel Naumov, Upper Bounds on Complexity of Frege Proofs with Limited Use of Certain Schemata, Archive for Mathematical Logic, pp. 432-446, v. 45, 2006

  • Pavel Naumov, On Modal Logic of Deductive Closure, Annals of Pure and Applied Logic, pp. 218-224, v. 141, n.1-2, 2006

    The Bulletin of Symbolic Logic, v. 11, n. 2, pp. 288-289, 2005

    Logic Colloquium 2004, ASL European Summer Meeting, p. 129, Turin, Italy, July 2004

  • Pavel Naumov, Logic of Subtyping, Theoretical Computer Science, pp. 167-185, v. 357, n.1-3, 2006

    The 18th Annual IEEE Symposium on Logic in Computer Science (LICS`03), Ottawa, Canada, June 2003 (poster)

    An extension of the classical propositional logic by type constructors, Winter Meeting of the Association for Symbolic Logic, Baltimore, January 2003, The Bulletin of Symbolic Logic, v. 9, n. 2, pp. 254-255, 2003

  • Pavel Naumov, On Modal Logics of Partial Recursive Functions, Studia Logica, pp. 295-309, v. 81, 2005

    On Modal Logics of Computable Functions, Annual Meeting of the Association for Symbolic Logic, Pittsburgh, May 2004, The Bulletin of Symbolic Logic, v. 11, n. 1, p. 113, 2005

  • P. Naumov, M.-O. Stehr, and J. Meseguer, The HOL/NuPRL Proof Translator: A Practical Approach to Formal Interoperatability, The 14th International Conference on Theorem Proving in Higher Order Logics, Edinburgh, Scotland, September 2001, pp. 329-345, Springer, Lecture Notes in Computer Science

  • M.-O. Stehr, P. Naumov, and J. Meseguer, A Proof-Theoretic Approach to HOL-Nuprl Connection with Applications to Proof Translation, 15th International Workshop on Algebraic Development Techniques/General Workshop of the Common Framework Initiative, Genova, Italy, April 2001, pp. 329-345

  • P. Naumov, Formalization of Isabelle Meta Logic in NuPRL, Supplemental proceedings of The 13th International Conference on Theorem Proving in Higher Order Logics, Portland, Oregon, 2000

  • R. Constable, P. Jackson, P. Naumov, and J. Uribe, Constructively Formalizing Automata Theory, in Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, 2000

  • P. Naumov, Importing Isabelle Formal Mathematics into NuPRL, Theorem Proving in Higher Order Logics: Emerging Trends 1999, Supplemental proceedings of The 12th International Conference on Theorem Proving in Higher Order Logics, Nice, France, 1999

  • P. Naumov, Undecidability of Second Order Provability Logic with Witness Comparison, Moscow University Mathematics Bulletin, v. 48, 1993, n. 3, pp. 13-15.

    Vestnik Moskovskogo Universiteta. Seriya I. Matematika, Mekhanika, v. 48, n. 3, 1993, pp. 14-17 (Russian)

  • P. Naumov, Undecidability of Goedel-Loeb Logic with Quantifiers over Propositional Variables, Moscow University Mathematics Bulletin, v. 48, 1993, n. 2, pp. 11-13

    Vestnik Moskovskogo Universiteta. Seriya I. Matematika, Mekhanika, v. 48, n. 2, 1993, pp. 13-16 (Russian)

  • P. Naumov, Modal logics that are conservative over intuitionistic predicate calculus, Moscow University Mathematics Bulletin, v. 46, n. 6, 1991, pp. 58-61

    Vestnik Moskovskogo Universiteta. Seriya I. Matematika, Mekhanika, v. 46, n. 6, 1991, pp. 86-90 (Russian).