Home // COMPUTATION TOOLS 2013, The Fourth International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking // View article
Authors:
Mikhail Peretyatkin
Keywords: first-order logic; computation; theory; computably axiomatizable theory; interpretation; signature reduction procedure; combinatorics.
Abstract:
In this work, we introduce general specifications for the concepts of finitary and infinitary first-order combinatorics as well as give preliminary definitions of semantic layers of model-theoretic properties connected with these combinatorics. We use only the simplest notions of first-order logic and algorithm theory together with elementary properties of signature reduction procedures and constructions of finitely axiomatizable theories known in common practice. The work represents an ideological basis and starting point for investigations on expressive power of first-order predicate logic.
Pages: 31 to 36
Copyright: Copyright (c) IARIA, 2013
Publication date: May 27, 2013
Published in: conference
ISSN: 2308-4170
ISBN: 978-1-61208-277-6
Location: Valencia, Spain
Dates: from May 27, 2013 to June 1, 2013