Results 231 to 240 of about 140,069 (266)

First-order logic with counting

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017
We introduce the logic FOCN(ℙ) which extends first-order logic by counting and by numerical predicates from a set ℙ, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature.
Dietrich Kuske, Nicole Schweikardt
openaire   +1 more source

On First Order Logic of Proofs

Moscow Mathematical Journal, 2001
Modal provability logic usually studies the operator `provable in PA' as the modal connective of necessity -- \(\square.\) Propositional provability logic was axiomatized by \textit{R. M. Solovay} [Isr. J. Math. 25, 287-304 (1976; Zbl 0352.02019)]. \textit{S. Artemov} [Ann. Pure Appl.
Artemov, Sergei, Yavorskaya, Tatiana
openaire   +2 more sources

First-Order Logic and First-Order Functions

Logica Universalis, 2015
This paper begins the study of first-order functions, which are a generalization of truth-functions. The concepts of truth-table and systems (and clones) of truth-functions, both introduced in propositional logic by Post, are also generalized and studied in the quantificational setting. The general facts about these concepts are given in the first five
openaire   +1 more source

Taming first-order logic

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

First order programming logic

Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79, 1979
First Order Programming Logic is a simple, yet powerful formal system for reasoning about recursive programs. In its simplest form, it has one major limitation: it cannot establish any property of the least fixed point of a recursive program which is false for some other fixed point.
Robert Cartwright, John McCarthy 0001
openaire   +1 more source

First Order Expressivist Logic

Erkenntnis, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

First-order Logic

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 ...
openaire   +1 more source

Is Hintikka's Logic First-Order?

Synthese, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matti Eklund, Daniel Kolak
openaire   +2 more sources

On first-order-logic databases

ACM Transactions on Database Systems, 1987
The use of first-order logic as database logic is shown to be powerful enough for formalizing and implementing not only relational but also hierarchical and network-type databases. It enables one to treat all the types of databases in a uniform manner. This paper focuses on the database language for heterogeneous databases. The language is
openaire   +2 more sources

First-order fuzzy logic

Studia Logica, 1987
This paper is an attempt to develop first-order fuzzy logic based on a truth set being either the interval \(\) or a finite chain. The syntax and semantics of first-order fuzzy logic are developed. The notion of a fuzzy theory in first-order fuzzy logic is introduced and its canonical model is constructed.
openaire   +1 more source