Results 281 to 290 of about 1,698,712 (321)
Some of the next articles are maybe not open access.
First Order Expressivist Logic
Erkenntnis, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Logic Journal of IGPL, 1998
In previous work by \textit{H. Andréka, J. van Benthem}, and \textit{I. Németi} [ibid. 3, No. 5, 685-720 (1995; Zbl 0840.03010)], some finite-variable fragments of first-order logic were defined via Kripke-style translations of multi-modal logic. Then these fragments were proved to be decidable.
openaire +3 more sources
In previous work by \textit{H. Andréka, J. van Benthem}, and \textit{I. Németi} [ibid. 3, No. 5, 685-720 (1995; Zbl 0840.03010)], some finite-variable fragments of first-order logic were defined via Kripke-style translations of multi-modal logic. Then these fragments were proved to be decidable.
openaire +3 more sources
1997
Abstract This chapter concerns some connections between graph theory and first-order logic. After an introduction to first-order logic and a discussion of which graph properties are first-order, we consider logical concepts such as ℵ0-categoricity and homogeneity for graphs, and present some theorems about finite graphs requiring logical
openaire +2 more sources
Abstract This chapter concerns some connections between graph theory and first-order logic. After an introduction to first-order logic and a discussion of which graph properties are first-order, we consider logical concepts such as ℵ0-categoricity and homogeneity for graphs, and present some theorems about finite graphs requiring logical
openaire +2 more sources
2011
In the 1930s Kurt Godel Alonso Church, and Alan Turing laid important foundations for logic and, theoretical computer science. Of particular interest for AI are Godel’s theorems. The completeness theorem states that first-order predicate logic is complete.
openaire +1 more source
In the 1930s Kurt Godel Alonso Church, and Alan Turing laid important foundations for logic and, theoretical computer science. Of particular interest for AI are Godel’s theorems. The completeness theorem states that first-order predicate logic is complete.
openaire +1 more source
1989
The first step in giving a formal account of first order logic (for which excellent introductory textbooks are due to Mendelson [1978] and van Dalen [1982]) is of course to specify, in a rigorous way, a language for it since, as indicated in Section 2.1, a language is required if a logic is to be defined. There exist infinitely many languages for first
openaire +1 more source
The first step in giving a formal account of first order logic (for which excellent introductory textbooks are due to Mendelson [1978] and van Dalen [1982]) is of course to specify, in a rigorous way, a language for it since, as indicated in Section 2.1, a language is required if a logic is to be defined. There exist infinitely many languages for first
openaire +1 more source
2019
This chapter explores First-Order Logic, an extension of Propositional Logic, which was the focus of Chapter 1. First-Order Logic takes into account the inner logical structure of proposition resulting from the presence of quantifiers and from specifying individuals, properties, and relations.
openaire +2 more sources
This chapter explores First-Order Logic, an extension of Propositional Logic, which was the focus of Chapter 1. First-Order Logic takes into account the inner logical structure of proposition resulting from the presence of quantifiers and from specifying individuals, properties, and relations.
openaire +2 more sources
2009
Mathematics and some other disciplines such as computer science often consider domains of individuals in which certain relations and operations are singled out. When using the language of propositional logic, our ability to talk about the properties of such relations and operations is very limited.
openaire +1 more source
Mathematics and some other disciplines such as computer science often consider domains of individuals in which certain relations and operations are singled out. When using the language of propositional logic, our ability to talk about the properties of such relations and operations is very limited.
openaire +1 more source
2020
In this chapter, we start by providing an overview of basic first-order logic concepts and results, namely, signature, language, relevant classes of formulas and several technical maps and relations. Then, we review semantic concepts like interpretation structure, satisfaction and entailment, as well as useful results like the Lemma of the Closed ...
João Rasga, Cristina Sernadas
openaire +1 more source
In this chapter, we start by providing an overview of basic first-order logic concepts and results, namely, signature, language, relevant classes of formulas and several technical maps and relations. Then, we review semantic concepts like interpretation structure, satisfaction and entailment, as well as useful results like the Lemma of the Closed ...
João Rasga, Cristina Sernadas
openaire +1 more source
2002
We next consider first-order logic, which is also called quantification theory and predicate calculus.1 Initially we discuss first-order logic without equality, and then we discuss first-order logic with equality in §26.
openaire +1 more source
We next consider first-order logic, which is also called quantification theory and predicate calculus.1 Initially we discuss first-order logic without equality, and then we discuss first-order logic with equality in §26.
openaire +1 more source
2009
In this chapter we introduce the first-order logics that correspond to the propositional ones discussed in the previous section. We will consider many-sorted firstorder logics where many-sortedness is significant for the applications further to be discussed.
Oleg M. Anshakov, Tamás Gergely
openaire +1 more source
In this chapter we introduce the first-order logics that correspond to the propositional ones discussed in the previous section. We will consider many-sorted firstorder logics where many-sortedness is significant for the applications further to be discussed.
Oleg M. Anshakov, Tamás Gergely
openaire +1 more source

