Boolean grammar, the Glossary
Boolean grammars, introduced by, are a class of formal grammars studied in formal language theory.[1]
Table of Contents
11 relations: Conjunctive grammar, Context-free grammar, Formal grammar, Formal language, International Conference on Developments in Language Theory, Language equation, Lecture Notes in Computer Science, Logic programming, Logical conjunction, Logical disjunction, Negation.
- Formal methods stubs
Conjunctive grammar
Conjunctive grammars are a class of formal grammars studied in formal language theory. Boolean grammar and Conjunctive grammar are formal languages.
See Boolean grammar and Conjunctive grammar
Context-free grammar
In formal language theory, a context-free grammar (CFG) is a formal grammar whose production rules can be applied to a nonterminal symbol regardless of its context. Boolean grammar and context-free grammar are formal languages.
See Boolean grammar and Context-free grammar
Formal grammar
A formal grammar describes which strings from an alphabet of a formal language are valid according to the language's syntax. Boolean grammar and formal grammar are formal languages.
See Boolean grammar and Formal grammar
Formal language
In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules called a formal grammar. Boolean grammar and formal language are formal languages.
See Boolean grammar and Formal language
International Conference on Developments in Language Theory
DLT, the International Conference on Developments in Language Theory is an academic conference in the field of computer science held annually under the auspices of the European Association for Theoretical Computer Science. Boolean grammar and International Conference on Developments in Language Theory are formal languages.
See Boolean grammar and International Conference on Developments in Language Theory
Language equation
Language equations are mathematical statements that resemble numerical equations, but the variables assume values of formal languages rather than numbers. Boolean grammar and language equation are formal languages.
See Boolean grammar and Language equation
Lecture Notes in Computer Science
Lecture Notes in Computer Science is a series of computer science books published by Springer Science+Business Media since 1973.
See Boolean grammar and Lecture Notes in Computer Science
Logic programming
Logic programming is a programming, database and knowledge representation paradigm based on formal logic.
See Boolean grammar and Logic programming
Logical conjunction
In logic, mathematics and linguistics, and (\wedge) is the truth-functional operator of conjunction or logical conjunction.
See Boolean grammar and Logical conjunction
Logical disjunction
In logic, disjunction, also known as logical disjunction or logical or or logical addition or inclusive disjunction, is a logical connective typically notated as \lor and read aloud as "or".
See Boolean grammar and Logical disjunction
Negation
In logic, negation, also called the logical not or logical complement, is an operation that takes a proposition P to another proposition "not P", standing for "P is not true", written \neg P, \mathord P or \overline.
See Boolean grammar and Negation
See also
Formal methods stubs
- Apomorphism
- Automath
- Axiomatic semantics
- Boolean grammar
- Chaff algorithm
- David Watt (computer scientist)
- Duration calculus
- Formal Methods Europe
- Implication table
- International Conference on Software Engineering and Formal Methods
- Interval temporal logic
- Liquid Haskell
- Logical relations
- Modal clausal form
- PRISM model checker
- Paramorphism
- Permutation automaton
- Picture language
- Predicative programming
- Programming Research Group
- Refinement calculus
- Romeo Model Checker
- TAPAAL Model Checker
- Temporal logic of actions
- Term graph
- Terminal yield
- Trace theory
- Uninterpreted function
- Uppaal Model Checker