Quantifiers metamorphoses. Generalizations, variations, algorithmic semantics

by   Alex Shkotin, et al.

This article contains ideas and their elaboration for quantifiers, which appeared after checking in practice the experimental language of the formal knowledge representation YAFOLL [1]: - looking at for_all and exists quantifiers as operators clarifying two trivial properties of a function: the constancy of result value and presence of a value in the result; -It turned out that the quantifier term can be written in the lambda calculus technique, i.e. as definition; -quantifier of quantity # is introduced into the language, as needed in practice and does not cause logical and algorithmic problems on finite structures; - the quantifier of the sum is mentioned because it is a quantifier of the language; -algorithmic semantics is written for for_all and exists quantifiers as an introduction to the topic.


page 1

page 2

page 3

page 4


Natural Language Semantics and Computability

This paper is a reflexion on the computability of natural language seman...

Q# as a Quantum Algorithmic Language

Q# is a standalone domain-specific programming language from Microsoft f...

Formal Semantics of the CDL Language

We reverse-engineer a formal semantics of the Component Definition Langu...

Formal Semantics of the Kconfig Language

The Kconfig language defines a set of symbols that are assigned a value ...

Can determinism and compositionality coexist in RML? (extended version)

Runtime verification (RV) consists in dynamically verifying that the eve...

Toward a language-theoretic foundation for planning and filtering

We address problems underlying the algorithmic question of automating th...

Symbolic Knowledge Structures and Intuitive Knowledge Structures

This paper proposes that two distinct types of structures are present in...