Searches , social queries for FIRST ORDER-PREDICATE

Search references for FIRST ORDER-PREDICATE. Phrases containing FIRST ORDER-PREDICATE

See searches and references containing FIRST ORDER-PREDICATE!

Searches containing FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

  • First-order logic
  • Type of logical system

    science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational logic, is a type of formal system. First-order logic

    First-order logic

    First-order_logic

  • First-order predicate
  • Logical statement with variables, predicates, and quantifiers over objects

    logic, a first-order predicate is a predicate that takes only individual(s) constants or variables as argument(s). Compare second-order predicate and higher-order

    First-order predicate

    First-order_predicate

  • Second-order predicate
  • Aspect of mathematical logic

    second-order predicate is a predicate that takes a first-order predicate as an argument. Compare higher-order predicate. The idea of second order predication

    Second-order predicate

    Second-order_predicate

  • Predicate (logic)
  • Symbol representing a property or relation in logic

    represent anything at all. For instance, in the first-order formula P(a), the symbol P is a predicate that applies to the individual constant a which

    Predicate (logic)

    Predicate_(logic)

  • Original proof of Gödel's completeness theorem
  • not be considered a rigorous proof of the theorem. We work with first-order predicate calculus. Our languages allow constant, function and relation symbols

    Original proof of Gödel's completeness theorem

    Original proof of Gödel's completeness theorem

    Original_proof_of_Gödel's_completeness_theorem

  • Monadic predicate calculus
  • Fragment of first-order logic

    logic, the monadic predicate calculus (also called monadic first-order logic) is the fragment of first-order logic (also called predicate calculus) in which

    Monadic predicate calculus

    Monadic_predicate_calculus

  • First-order
  • Index of articles associated with the same name

    science First-order predicate, a predicate that takes only individual(s) constants or variables as argument(s) First-order predicate calculus First-order theorem

    First-order

    First-order

  • Consistency
  • Non-contradiction of a theory

    1918[citation needed] and Emil Post in 1921, while the completeness of (first order) predicate calculus was proved by Kurt Gödel in 1930, and consistency proofs

    Consistency

    Consistency

  • Metalogic
  • Study of the properties of logical systems

    Post 1920) Completeness of first-order monadic predicate logic (Leopold Löwenheim 1915) Completeness of first-order predicate logic (Gödel's completeness

    Metalogic

    Metalogic

  • Relational model
  • Database model

    managing data using a structure and language consistent with first-order predicate logic, first described in 1969 by English computer scientist Edgar F. Codd

    Relational model

    Relational_model

  • Predicate variable
  • Type of mathematical variable

    for denoting predicate variables include capital roman letters such as P, Q and R, or lower case roman letters, e.g., x. In first-order logic, they can

    Predicate variable

    Predicate_variable

  • Categorical proposition
  • Statement regarding whether or not an item belongs to a category

    the increased expressive power of modern logic systems like the first-order predicate calculus, they still retain practical value in addition to their

    Categorical proposition

    Categorical_proposition

  • Predicate (grammar)
  • Linguistic term

    The term predicate is used in two ways in linguistics and its subfields. The first defines a predicate as everything in a standard declarative sentence

    Predicate (grammar)

    Predicate_(grammar)

  • Semantic reasoner
  • Software able to infer logical consequences

    language, and often a description logic language. Many reasoners use first-order predicate logic to perform reasoning; inference commonly proceeds by forward

    Semantic reasoner

    Semantic_reasoner

  • Fril
  • Programming language

    Fril is a programming language for first-order predicate calculus. It includes the semantics of Prolog as a subset, but takes its syntax from the micro-PROLOG [es]

    Fril

    Fril

  • Gödel's completeness theorem
  • Fundamental theorem in mathematical logic

    converted into the other).[citation needed] We first fix a deductive system of first-order predicate calculus, choosing any of the well-known equivalent

    Gödel's completeness theorem

    Gödel's completeness theorem

    Gödel's_completeness_theorem

  • Second-order logic
  • Form of logic that allows quantification over predicates

    the predicate. That is, the following expression: ∃PP(b) is not a sentence of first-order logic, but this is a legitimate sentence of second-order logic

    Second-order logic

    Second-order_logic

  • Object–role modeling
  • Programming technique

    An object–role model uses graphical symbols that are based on first order predicate logic and set theory to enable the modeler to create an unambiguous

    Object–role modeling

    Object–role modeling

    Object–role_modeling

  • Epsilon calculus
  • Extension of a formal language by the epsilon operator

    operator and epsilon substitution method are typically applied to a first-order predicate calculus, followed by a demonstration of consistency. The epsilon-extended

    Epsilon calculus

    Epsilon_calculus

  • Syllogism
  • Type of logical argument that applies deductive reasoning

    Within some academic contexts, syllogism has been superseded by first-order predicate logic following the work of Gottlob Frege, in particular his Begriffsschrift

    Syllogism

    Syllogism

    Syllogism

  • Corresponding conditional
  • results confirm the validity of the argument A Some arguments need first-order predicate logic to reveal their forms and they cannot be tested properly by

    Corresponding conditional

    Corresponding_conditional

  • Completeness (logic)
  • Characteristic of some logical systems

    introducing an inconsistency. Truth-functional propositional logic and first-order predicate logic are semantically complete, but not syntactically complete

    Completeness (logic)

    Completeness_(logic)

  • Principia Mathematica
  • 3-volume treatise on mathematics, 1910–1913

    and consistent. In 1930 Gödel's completeness theorem showed that first-order predicate logic itself was complete in a much weaker sense—that is, any sentence

    Principia Mathematica

    Principia Mathematica

    Principia_Mathematica

  • Data model
  • Abstract model

    based on first-order predicate logic. Its core idea is to describe a database as a collection of predicates over a finite set of predicate variables

    Data model

    Data model

    Data_model

  • Semantic network
  • Knowledge base that represents semantic relations between concepts in a network

    first order predicate calculus as a base, after being inspired by a demonstration of Victor Yngve. The "line of research was originated by the first President

    Semantic network

    Semantic network

    Semantic_network

  • Laws of logic
  • Topics referred to by the same term

    Law of logic may refer to: Basic laws of Propositional Logic or First Order Predicate Logic Rules of inference, which dictate the valid use of inferential

    Laws of logic

    Laws_of_logic

  • Propositional variable
  • Variable that can either be true or false

    as x and y attached to predicate letters such as Px and xRy, having instead individual constants a, b, ... attached to predicate letters are propositional

    Propositional variable

    Propositional_variable

  • Resolution (logic)
  • Inference rule in logic, proof theory, and automated theorem proving

    however, it could not be used as p due to its syntactic form. For first-order predicate logic, Murray's rule is generalized to allow distinct, but unifiable

    Resolution (logic)

    Resolution_(logic)

  • Automated theorem proving
  • Subfield of automated reasoning and mathematical logic

    algorithms are believed to exist for general proof tasks. For a first-order predicate calculus, Gödel's completeness theorem states that the theorems

    Automated theorem proving

    Automated_theorem_proving

  • Reification (information retrieval)
  • meaning representations allow one to use the tools of classical first-order predicate calculus even for statements which, due to their use of tense, modality

    Reification (information retrieval)

    Reification_(information_retrieval)

  • Lift (mathematics)
  • S^{2}&&\ {\text{ (sphere path)}}\end{aligned}}} The notations of first-order predicate logic are streamlined when quantifiers are relegated to established

    Lift (mathematics)

    Lift_(mathematics)

  • Database normalization
  • Reduction of data redundancy

    of a universal data sub-language based on an applied predicate calculus. A first-order predicate calculus suffices if the collection of relations is in

    Database normalization

    Database_normalization

  • Semantic resolution tree
  • theoretical tool for showing the unsatisfiability of clauses in first-order predicate logic. Kundu, S (1986-12-01). "Tree resolution and generalized semantic

    Semantic resolution tree

    Semantic_resolution_tree

  • Language of thought hypothesis
  • Hypothesis of philosopher Jerry Fodor

    tallness, combined in a manner that may be expressed in first-order predicate calculus as a predicate 'T' ("is tall") that holds of the entity 'j' (John)

    Language of thought hypothesis

    Language_of_thought_hypothesis

  • Logic programming
  • Programming paradigm based on formal logic

    is a relational expression, which is similar to an expression in first-order predicate logic. Other relational programming languages are based on the relational

    Logic programming

    Logic_programming

  • List of pioneers in computer science
  • Sammartino (2009-09-01). Tim Berners-Lee: Inventor of the World Wide Web. Twenty-First Century Books. ISBN 978-0-8225-7273-2. "A.M. Turing Award Laureate – Manuel

    List of pioneers in computer science

    List_of_pioneers_in_computer_science

  • Well-formed formula
  • Syntactically correct logical formula

    propositional logic and predicate logic. A key use of formulas is in propositional logic and predicate logic such as first-order logic. In those contexts

    Well-formed formula

    Well-formed_formula

  • First-order inductive learner
  • subset of first-order predicate calculus. Given positive and negative examples of some concept and a set of background-knowledge predicates, FOIL inductively

    First-order inductive learner

    First-order_inductive_learner

  • Higher-order logic
  • Formal system of logic

    those of first-order logic. The term "higher-order logic" is commonly used to mean higher-order simple predicate logic. Here, "simple" indicates that the

    Higher-order logic

    Higher-order_logic

  • Equality (mathematics)
  • Basic notion of sameness in mathematics

    the first-order logic may be regarded as a mere matter of convenience, as noted by Azriel Lévy: The reason why we take up first-order predicate calculus

    Equality (mathematics)

    Equality (mathematics)

    Equality_(mathematics)

  • Prolog
  • Programming language that uses first order logic

    domain of first-order logic, which does not allow quantification over predicates, ISO Prolog now has some built-in higher-order predicates such as call/1

    Prolog

    Prolog

  • ML (programming language)
  • General purpose functional programming language

    PPLAMBDA, a language that was conceptually a combination of the first-order predicate calculus and the simply typed polymorphic lambda calculus, was the

    ML (programming language)

    ML_(programming_language)

  • Monadic second-order logic
  • Form of second-order logic

    Second-order logic allows quantification over predicates. However, MSO is the fragment in which second-order quantification is limited to monadic predicates

    Monadic second-order logic

    Monadic_second-order_logic

  • Modus tollens
  • Rule of logical inference

    subset of Q. x is not in Q. Therefore, x is not in P.") Also in first-order predicate logic: ∀x: P(x)→Q(x) ¬Q(y) ∴ ¬P(y) ("For all x if x is P then x

    Modus tollens

    Modus_tollens

  • Configuration management database
  • Database used to store info on hardware and software assets

    and a semantic data model. Relational data models are based on first-order predicate logic and all data is represented in terms of tuples that are grouped

    Configuration management database

    Configuration_management_database

  • Philosophical language
  • Any constructed language that is constructed from first principles

    that these states of affairs can be expressed by the language of first-order predicate logic. Thus a picture of the universe can be construed by means

    Philosophical language

    Philosophical_language

  • Converse (logic)
  • Concept in mathematical logic

    converse per accidens "Some mammals are unicorns" is clearly false. In first-order predicate calculus, All S are P can be represented as ∀x.S(x)→P(x). It is

    Converse (logic)

    Converse_(logic)

  • Predicate transformer semantics
  • Reformulation of Floyd-Hoare logic

    proving a first-order formula. Technically, predicate transformer semantics perform a kind of symbolic execution of statements into predicates: execution

    Predicate transformer semantics

    Predicate_transformer_semantics

  • Outline of logic
  • Overview of and topical guide to logic

    (predicate logic) First-order logic First-order predicate Formation rule Free variables and bound variables Generalization (logic) Monadic predicate calculus

    Outline of logic

    Outline_of_logic

  • Temperature paradox
  • Logical paradox

    systems of logic. For instance, the following formalization in first order predicate logic would be valid via Leibniz's law: t=90 R(t) R(90) (valid conclusion

    Temperature paradox

    Temperature_paradox

  • Parlog
  • utilization of parallel computer architectures. Its semantics is based on first order predicate logic. It expresses concurrency, interprocess communication, indeterminacy

    Parlog

    Parlog

  • Willard Van Orman Quine
  • American philosopher and logician (1908–2000)

    philosophy students did not do justice to quantification theory or first-order predicate logic. Quine wrote this book in 6 weeks as an ad hoc solution to

    Willard Van Orman Quine

    Willard Van Orman Quine

    Willard_Van_Orman_Quine

  • Procedural reasoning system
  • Decision-making framework for artificial intelligence

    components: Database for beliefs about the world, represented using first order predicate calculus. Goals to be realized by the system as conditions over

    Procedural reasoning system

    Procedural_reasoning_system

  • Predicate functor logic
  • Algebraization of first-order logic

    In mathematical logic, predicate functor logic (PFL) is one of several ways to express first-order logic (also known as predicate logic) by purely algebraic

    Predicate functor logic

    Predicate_functor_logic

  • Interpretation (logic)
  • Assignment of meaning to the symbols of a formal language

    line l. A formal language for higher-order predicate logic looks much the same as a formal language for first-order logic. The difference is that there

    Interpretation (logic)

    Interpretation_(logic)

  • Lars Svenonius
  • Swedish logician and philosopher

    _{0}} -categoricity in first-order predicate calculus, A theorem on permutations in models, On minimal models of first-order systems. In particular,

    Lars Svenonius

    Lars_Svenonius

  • Ontology (information science)
  • Specification of a conceptualization

    its own ontology language called CycL, based on first-order predicate calculus with some higher-order extensions. DOGMA (Developing Ontology-Grounded

    Ontology (information science)

    Ontology (information science)

    Ontology_(information_science)

  • Database
  • Organized collection of data in computing

    operations to be defined in terms of the established discipline of first-order predicate calculus; because these operations have clean mathematical properties

    Database

    Database

    Database

  • Syntax (logic)
  • Rules used for constructing, or transforming the symbols and words of a language

    introducing an inconsistency. Truth-functional propositional logic and first-order predicate logic are semantically complete, but not syntactically complete

    Syntax (logic)

    Syntax (logic)

    Syntax_(logic)

  • Lambda cube
  • Framework in lambda calculus

    impredicative way in second and higher order logics. In the weak higher order logics, there are variables for higher order predicates, but no quantification on those

    Lambda cube

    Lambda cube

    Lambda_cube

  • Word order
  • Order of syntactic constituents

    In linguistics, word order (also known as linear order) is the order of the syntactic constituents of a language. Word order typology studies it from

    Word order

    Word order

    Word_order

  • Z notation
  • Formal specification language used for describing and modelling computing systems

    mathematical notation used in axiomatic set theory, lambda calculus, and first-order predicate logic. All expressions in Z notation are typed, thereby avoiding

    Z notation

    Z notation

    Z_notation

  • Philosophy of logic
  • Study of the scope and nature of logic

    contradiction. Higher-order logics extend classical first-order predicate logic by including new forms of quantification. In first-order logic, quantification

    Philosophy of logic

    Philosophy_of_logic

  • Finite model theory
  • Branch of logic

    предикатов" [Volume and fraction of satisfiability of formulae of the first-order predicate calculus]. Kibernetika. 5 (2): 17–27. Also available as;"Range and

    Finite model theory

    Finite_model_theory

  • Semantics (logic)
  • Study of the semantics, or interpretations, of formal and natural languages

    them to some predefined mathematical domains: an interpretation of first-order predicate logic is given by a mapping from terms to a universe of individuals

    Semantics (logic)

    Semantics_(logic)

  • Intuitionistic logic
  • Various systems of symbolic logic

    OR-3: (ϕ→ψ)→((χ→ψ)→((ϕ∨χ)→ψ)) FALSE: ⊥→ϕ To make this a system of first-order predicate logic, the generalization rules ∀-GEN: from ψ→ϕ infer ψ→(∀x ϕ),

    Intuitionistic logic

    Intuitionistic_logic

  • History of the function concept
  • About mathematical functions

    . . by a well-formed formula in the simple predicate calculus of first order in which the sole predicate constants are ε and possibly, =. ... Today an

    History of the function concept

    History_of_the_function_concept

  • Legal informatics
  • Information science by discipline

    documents bears a close resemblance to the Horn clause subset of first order predicate calculus. Moreover, it identified the need to extend the use of

    Legal informatics

    Legal_informatics

  • Inductive logic programming
  • Learning logic programs from data

    ISBN 0-262-19218-7. Muggleton, S.H.; Buntine, W. (1988). "Machine invention of first-order predicate by inverting resolution". Proceedings of the 5th International Conference

    Inductive logic programming

    Inductive logic programming

    Inductive_logic_programming

  • Dictum de omni et nullo
  • hypothetical syllogism in first-order predicate logic. Nevertheless, Aristotelian syllogistic does not employ the formal machinery of first-order quantification

    Dictum de omni et nullo

    Dictum_de_omni_et_nullo

  • FPC
  • Topics referred to by the same term

    rights supporting organization based in the United States First-order predicate calculus First Parish in Cambridge, a church in Massachusetts, United States

    FPC

    FPC

  • Notation system
  • Convention where symbols represent concepts

    notation for specifying objects using Zermelo–Fraenkel set theory and first-order predicate logic Ordinal notation Set-builder notation, a formal notation for

    Notation system

    Notation_system

  • Prolog syntax and semantics
  • Set of rules defining correctly structured Prolog programs

    Prolog is restricted to Horn clauses, a Turing-complete subset of first-order predicate logic. There are two types of clauses: Facts and rules. A rule is

    Prolog syntax and semantics

    Prolog_syntax_and_semantics

  • Ontology engineering
  • Field that studies the methods and methodologies for building ontologies

    its own ontology language called CycL, based on first-order predicate calculus with some higher-order extensions. The Gellish language includes rules

    Ontology engineering

    Ontology engineering

    Ontology_engineering

  • Quantifier (logic)
  • Mathematical use of "for all" and "there exists"

    quantification requires first-order predicate calculus with equality. This means there is given a distinguished two-placed predicate "="; the semantics is

    Quantifier (logic)

    Quantifier_(logic)

  • Peano axioms
  • Axioms for the natural numbers

    one can consider a first-order axiom schema of induction. Such a schema includes one axiom per predicate definable in the first-order language of Peano

    Peano axioms

    Peano_axioms

  • Logic of graphs
  • Logical formulation of graph properties

    be used in these sentences. The first-order logic of graphs concerns sentences in which the variables and predicates concern individual vertices and edges

    Logic of graphs

    Logic_of_graphs

  • Ω-consistent theory
  • Mathematical theory

    The system of ω-logic includes all axioms and rules of the usual first-order predicate logic, together with, for each T-formula P(x) with a specified free

    Ω-consistent theory

    Ω-consistent_theory

  • Method of analytic tableaux
  • Tool for proving a logical formula

    gives an assignment that falsifies A. Tableaux are extended to first-order predicate logic by two rules for dealing with universal and existential quantifiers

    Method of analytic tableaux

    Method of analytic tableaux

    Method_of_analytic_tableaux

  • Paradoxes of set theory
  • logician Thoralf Skolem showed in 1922 that every consistent theory of first-order predicate calculus, such as set theory, has an at most countable model. However

    Paradoxes of set theory

    Paradoxes_of_set_theory

  • Theoria (philosophy journal)
  • Academic journal

    Paradoxes of Confirmation, Theoria 31, 1965, 255–274. Per Lindström, First Order Predicate Logic with Generalized Quantifiers, Theoria 32, 1966, 186–195. (Lindström

    Theoria (philosophy journal)

    Theoria_(philosophy_journal)

  • Truth-bearer
  • Entities that are said to be either true or false

    truth-bearer. For example, a language in the first-order predicate calculus might include one or more predicate symbols and one or more individual constants

    Truth-bearer

    Truth-bearer

  • Cylindric algebra
  • Algebraization of first-order logic with equality

    algebra.[example needed] It is easier to connect the semantics of first-order predicate logic with cylindric set algebra. (For more details, see § Further

    Cylindric algebra

    Cylindric_algebra

  • Axiom of empty set
  • Axiom of Set Theory

    contradictory formula, for example ∅={u∈w∣u≠u}. In many formulations of first-order predicate logic, the existence of at least one object is always guaranteed

    Axiom of empty set

    Axiom_of_empty_set

  • SETL
  • Programming language

    constructed using the universal and existential quantifiers of first-order predicate logic. SETL provides several iterators to produce a variety of loops

    SETL

    SETL

  • Semantic interoperability
  • Concept in information technology

    purpose language such as XML. Languages with the full power of first-order predicate logic may be required for many tasks. Human languages are highly

    Semantic interoperability

    Semantic_interoperability

  • Relational
  • Topics referred to by the same term

    relational calculus Relational model, a database model based on first-order predicate logic Relational operator, a programming language construct or operator

    Relational

    Relational

  • Clause
  • Smallest grammatical unit that can express a complete proposition

    predicand (expressed or not) and a semantic predicate. A typical clause consists of a subject and a syntactic predicate, the latter typically a verb phrase composed

    Clause

    Clause

  • Gödel's ontological proof
  • Formal argument for the existence of God

    in symbolic logic: φ(x): "Object x has property φ" (notation for first-order predicates) ⇒: "implies" (material implication) ∀x: "For every x", or "for

    Gödel's ontological proof

    Gödel's_ontological_proof

  • Function symbol
  • Symbol representing a mathematical concept

    functional predicates F; how do you know ahead of time whether it satisfies that condition? To get an equivalent formulation of the schema, first replace

    Function symbol

    Function_symbol

  • Navigational database
  • Database in which records or objects are found by following references from other objects

    recursive: the mathematics originally underpinning SQL (specifically, first-order predicate calculus) does not have sufficient power to support recursive queries

    Navigational database

    Navigational_database

  • Sequent calculus
  • Style of formal logical argumentation

    left from the propositions on the right A and B denote formulas of first-order predicate logic (one may also restrict this to propositional logic), Γ,Δ,Σ

    Sequent calculus

    Sequent_calculus

  • Per Lindström
  • Swedish logician (1936–2009)

    Theory of Models of First Order Languages. A festschrift for Lindström was published in 1986. Per Lindström, First Order Predicate Logic with Generalized

    Per Lindström

    Per_Lindström

  • Outline of databases
  • Overview of and topical guide to databases

    model – for database management is a database model based on first-order predicate logic, first formulated and proposed in 1969 by Edgar F. Object–relational

    Outline of databases

    Outline_of_databases

  • Unifying Theories of Programming
  • Formal semantics and 1998 book

    semantic foundation of the UTP is the first-order predicate calculus, augmented with fixed-point constructs from second-order logic. Following the tradition

    Unifying Theories of Programming

    Unifying_Theories_of_Programming

  • Von Neumann–Bernays–Gödel set theory
  • System of mathematical set theory

    Mendelson's modification. This means that NBG is an axiomatic system in first-order predicate logic with equality, and its only primitive notions are of classes

    Von Neumann–Bernays–Gödel set theory

    Von_Neumann–Bernays–Gödel_set_theory

  • Real number
  • Number representing a continuous quantity

    the classical logic of first-order predicates. This is one of the reasons for which higher-order logics were developed in the first half of the 20th century

    Real number

    Real number

    Real_number

  • Entscheidungsproblem
  • Impossible task in computing

    kinds of sentences as a fragment of first-order logic:∀x,p(x)→±q(x),∃x,p(x)∧±q(x)where p,q are atomic predicates, and +q:=q,−q:=¬q. Given a finite set

    Entscheidungsproblem

    Entscheidungsproblem

  • Syntactic predicate
  • syntactic predicates implicitly order the productions so that predicated productions specified earlier have higher precedence than predicated productions

    Syntactic predicate

    Syntactic_predicate

  • Stratification (mathematics)
  • Index of articles associated with the same name

    mathematical logic, stratification is any consistent assignment of numbers to predicate symbols guaranteeing that a unique formal interpretation of a logical

    Stratification (mathematics)

    Stratification_(mathematics)

Searches for online references containing FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

Search references containing FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

Search queries for Facebook and twitter posts, hashtags with FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

Follow users with usernames @FIRST ORDER-PREDICATE or posting hashtags containing #FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

Online names & meanings

Search queries for Facebook and twitter users, user names, hashtags with FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

Top search, Social media, medium, facebook & news articles containing FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

Searches for Acronyms & meanings containing FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE

Searches, Indeed job searches and job offers containing FIRST ORDER-PREDICATE

Other words and meanings similar to

FIRST ORDER-PREDICATE

Search in online dictionary sources & meanings containing FIRST ORDER-PREDICATE

FIRST ORDER-PREDICATE