Skip to search formSkip to main contentSkip to account menu

Well-formed formula

Known as: Layman Allen, Well-formed, Formula (logics) 
In mathematical logic, a well-formed formula, abbreviated wff, often simply formula, is a finite sequence of symbols from a given alphabet that is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Admissible ruleAtomic formulaAtomic sentenceAutomated theorem proving

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Achieving Open Vocabulary Neural Machine Translation with Hybrid Word-Character Models
Nearly all previous work on neural machine translation (NMT) has used quite restricted vocabularies, perhaps with a subsequent… 
Highly Cited
2009
Highly Cited
2009
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination… 
Review
2005
Review
2005
VESTA: A statistical model-checker and analyzer for probabilistic systems
We give a brief overview of a statistical model-checking and analysis tool VESTA. VESTA is a tool for statistical analysis of… 
Highly Cited
2004
Highly Cited
2004
Synthesis and Optical Properties of ``Branched'' Gold Nanocrystals
We report the synthesis of new “branched” gold nanocrystals in high yield (over 90%) via a wet-chemical route. The branched… 
Highly Cited
1999
Highly Cited
1999
Template-Directed Preparation of Macroporous Polymers with Oriented and Crystalline Arrays of Voids
The fabrication of polymeric materials with ordered submicron-sized void structures is potentially valuable for many separation… 
Review
1998
Review
1998
Book Reviews: Beyond Grammar: An Experience-based Theory of Language
1. Introduction: what are the productive units of natural language? 2. A DOP model for tree representations 3. Formal stochastic… 
Highly Cited
1995
Highly Cited
1995
RF Design Guide Systems, Circuits and Equations
System Design and Specification. Circuit Examples. Measurement Techniques. Useful Formulas. 
Highly Cited
1994
Highly Cited
1994
On the combinatorial and algebraic complexity of quantifier elimination
In this paper we give a new algorithm for performing quantifier elimination from first order formulae over real closed fields… 
Highly Cited
1991
Highly Cited
1991
On Well-Formed Coloured Nets and Their Symbolic Reachability Graph
The new class of Well Formed Coloured Nets (WN) is formally defined as an extension of Regular Nets (RN), together with an… 
Highly Cited
1951
Highly Cited
1951
A theorem about infinite-valued sentential logic
In this paper we shall use a logic with truth values ranging over all the real numbers x such that 0 ≦ x ≦ 1.1 will be “complete… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)