علامة first-order-logic - هذه الصفحة 9 - GeneraCodice

Bachmair and Ganzinger, ordering of equations

https://www.generacodice.com/ar/articolo/1607043/bachmair-and-ganzinger-ordering-of-equations
  logic  -  first-order-logic  -  automated-theorem-proving
cs.stackexchange cs.stackexchange

Must $x$ and $y$ be different in a statement of the form $\forall x \forall y \cdots$?

https://www.generacodice.com/ar/articolo/1605575/must-x-and-y-be-different-in-a-statement-of-the-form-forall-x-forall-y-cdots
  logic  -  first-order-logic  -  predicate-logic
cs.stackexchange cs.stackexchange

How do we translate first order logic's universal quantifier (the $\forall$) and the existential quantifier (the $\exists$) to Prolog?

https://www.generacodice.com/ar/articolo/1603676/how-do-we-translate-first-order-logic-s-universal-quantifier-the-forall-and-the-existential-quantifier-the-exists-to-prolog
  prolog  -  first-order-logic
cs.stackexchange cs.stackexchange

Are the definitions of recursively enumerate equivalent?

https://www.generacodice.com/ar/articolo/1603372/are-the-definitions-of-recursively-enumerate-equivalent
  terminology  -  computability  -  first-order-logic
cs.stackexchange cs.stackexchange

Represent there are infinitely many in FOL

https://www.generacodice.com/ar/articolo/1600730/represent-there-are-infinitely-many-in-fol
  logic  -  first-order-logic
cs.stackexchange cs.stackexchange

How to convert statement with the existential quantifier to statement with universal quantifier?

https://www.generacodice.com/ar/articolo/1600483/how-to-convert-statement-with-the-existential-quantifier-to-statement-with-universal-quantifier
  first-order-logic
cs.stackexchange cs.stackexchange

Logical characterization of P versus NP problem (and references for least fixed point logic)

https://www.generacodice.com/ar/articolo/1600388/logical-characterization-of-p-versus-np-problem-and-references-for-least-fixed-point-logic
  logic  -  fixed-point  -  first-order-logic  -  p-vs-np
cs.stackexchange cs.stackexchange

Resolution of Barber paradox

https://www.generacodice.com/ar/articolo/1600192/resolution-of-barber-paradox
  first-order-logic
cs.stackexchange cs.stackexchange

The equational theory of regular languages has no finite set of axioms for general alphabets

https://www.generacodice.com/ar/articolo/1598564/the-equational-theory-of-regular-languages-has-no-finite-set-of-axioms-for-general-alphabets
  finite-automata  -  formal-languages  -  first-order-logic  -  regular-languages
cs.stackexchange cs.stackexchange

The set of valid sentences in FO is not decidable as a consequence of rec. inseparability

https://www.generacodice.com/ar/articolo/1597730/the-set-of-valid-sentences-in-fo-is-not-decidable-as-a-consequence-of-rec-inseparability
  complexity-theory  -  logic  -  computability  -  first-order-logic  -  undecidability
cs.stackexchange cs.stackexchange
العثور على نتائج: 218
scroll top