David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 77 (3):828-852 (2012)
By operations on models we show how to relate completeness with respect to permissivenominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal models, so the construction hinges on generating from an instance of the latter, some instance of the former in which sufficiently many inequalities are preserved between elements. We do this using an infinite generalisation of nominal atoms-abstraction. The results are of interest in their own right, but also, we factor the mathematics so as to maximise the chances that it could be used off-the-shelf for other nominal reasoning systems too. Models with infinite support can be easier to work with, so it is useful to have a semi-automatic theorem to transfer results from classes of infinitely-supported nominal models to the more restricted class of models with finite support. In conclusion, we consider different permissive-nominal syntaxes and nominal models and discuss how they relate to the results proved here
|Keywords||permissive-nominal techniques infinite support finite support, nominal algebra, permissive-nominal logic, completeness infinite atoms-abstraction|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
James Cheney (2006). Completeness and Herbrand Theorems for Nominal Logic. Journal of Symbolic Logic 71 (1):299 - 320.
Roman Tuziak (1988). An Axiomatization of the Finite-Valued Łukasiewicz Calculus. Studia Logica 47 (1):49 - 55.
Tobias Rosefeldt (2008). 'That'-Clauses and Non-Nominal Quantification. Philosophical Studies 137 (3):301 - 333.
Sobhi Rayan (2009). Nominal Definition in the Writings of Ibn Taymiyya. International Studies in the Philosophy of Science 23 (2):123 – 141.
Ross Willard (2000). A Finite Basis Theorem for Residually Finite, Congruence Meet-Semidistributive Varieties. Journal of Symbolic Logic 65 (1):187-200.
Kerstin Anna Kunz (2010). Variation in English and German Nominal Coreference: A Study of Political Essays. Peter Lang.
Albert Visser (1981). A Propositional Logic with Explicit Fixed Points. Studia Logica 40 (2):155 - 175.
Branden Fitelson (2001). Comments on Some Completeness Theorems of Urquhart and Méndez & Salto. Journal of Philosophical Logic 30 (1):51 - 55.
Kenneth Harris & Branden Fitelson (2001). Comments on Some Completeness Theorems of Urquhart and Méndez & Salto. Journal of Philosophical Logic 30 (1):51-55.
Giovanna Corsi (2002). A Unified Completeness Theorem for Quantified Modal Logics. Journal of Symbolic Logic 67 (4):1483-1510.
Yde Venema (1998). Rectangular Games. Journal of Symbolic Logic 63 (4):1549-1564.
Tamar Lando (2012). Completeness of S4 for the Lebesgue Measure Algebra. Journal of Philosophical Logic 41 (2):287-316.
Added to index2012-11-06
Total downloads6 ( #230,346 of 1,410,435 )
Recent downloads (6 months)1 ( #177,872 of 1,410,435 )
How can I increase my downloads?