Home // COMPUTATION TOOLS 2014, The Fifth International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking // View article
Authors:
Mikhail Peretyatkin
Keywords: first order logic; theory; finitely axiomatizable theory; computably axiomatizable theory; Tarski-Lindenbaum algebra; model-theoretic property; computation; first-order combinatorics
Abstract:
In this work, we proceed to study finitary and infinitary first-order combinatorics within the framework of a new approach intended to investigations of predicate logic. Some properties of these combinatorics are established. We present a general scheme of semantic layers of model-theoretic properties having importance in the given direction. A number of demonstrations is given showing essence of both finitary and infinitary combinatorial methods for first-order theories. The work represents a basis for further investigations on expressive power of predicate logic.
Pages: 19 to 25
Copyright: Copyright (c) IARIA, 2014
Publication date: May 25, 2014
Published in: conference
ISSN: 2308-4170
ISBN: 978-1-61208-344-5
Location: Venice, Italy
Dates: from May 25, 2014 to May 29, 2014