Incidence matrix: Difference between revisions
en>David Eppstein →Undirected and directed graphs: orientation |
en>Akriasas Undid revision 537083154 by 213.55.107.151 (talk) |
||
Line 1: | Line 1: | ||
In [[mathematical logic]], reduction to '''Skolem normal form''' (SNF) is a method for removing [[existential quantification|existential quantifiers]] from [[formal logic]] statements, often performed as the first step in an [[automated theorem prover]]. | |||
A [[formula]] of [[first-order logic]] is in Skolem normal form (named after [[Thoralf Skolem]]) if it is in [[prenex normal form]] with only [[Universal quantification|universal first-order quantifiers]]. Every first-order [[Well-formed formula|formula]] can be converted into Skolem normal form while not changing its [[satisfiability]] via a process called '''Skolemization''' (sometimes spelled "Skolemnization"). The resulting formula is not necessarily [[logical equivalence|equivalent]] to the original one, but is [[equisatisfiable]] with it: it is satisfiable if and only if the original one is satisfiable.<ref>{{cite web|title=Normal Forms and Skolemization|url=http://www.mpi-inf.mpg.de/departments/rg1/teaching/autrea-ss10/script/lecture10.pdf|publisher=max planck institut informatik|accessdate=15 December 2012}}</ref> | |||
The simplest form of Skolemization is for existentially quantified variables which are not inside the scope of a universal quantifier. These can simply be replaced by creating new constants. For example, <math>\exists x P(x)</math> can be changed to <math>P(c)</math>, where <math>c</math> is a new constant (does not occur anywhere else in the formula). | |||
More generally, Skolemization is performed by replacing every existentially quantified variable <math>y</math> with a term <math>f(x_1,\ldots,x_n)</math> whose function symbol <math>f</math> is new. The variables of this term are as follows. If the formula is in [[prenex normal form]], <math>x_1,\ldots,x_n</math> are the variables that are universally quantified and whose quantifiers precede that of <math>y</math>. In general, they are the variables that are universally quantified {{clarify|reason=If the formula is not in prenex form, also some existentially quantified variables may belong to the x, e.g. the formula ¬∃x ¬∃y. p(x,y) should be skolemized to is equivalent to ¬∃x. ¬ p(x,f(x)).|date=August 2013}} and such that <math>\exists y</math> occurs in the scope of their quantifiers. The function <math>f</math> introduced in this process is called a '''Skolem function''' (or '''Skolem constant''' if it is of zero [[arity]]) and the term is called a '''Skolem term'''. | |||
As an example, the formula <math>\forall x \exists y \forall z. P(x,y,z)</math> is not in Skolem normal form because it contains the existential quantifier <math>\exists y</math>. Skolemization replaces <math>y</math> with <math>f(x)</math>, where <math>f</math> is a new function symbol, and removes the quantification over <math>y</math>. The resulting formula is <math>\forall x \forall z . P(x,f(x),z)</math>. The Skolem term <math>f(x)</math> contains <math>x</math> but not <math>z</math> because the quantifier to be removed <math>\exists y</math> is in the scope of <math>\forall x</math> but not in that of <math>\forall z</math>; since this formula is in prenex normal form, this is equivalent to saying that, in the list of quantifers, <math>x</math> precedes <math>y</math> while <math>z</math> does not. The formula obtained by this transformation is satisfiable if and only if the original formula is. | |||
==How Skolemization works== | |||
Skolemization works by applying a [[second-order logic|second-order]] equivalence in conjunction to the definition of first-order satisfiability. The equivalence provides a way for "moving" an existential quantifier before a universal one. | |||
:<math>\forall x \Big( g(x) \vee \exists y R(x,y) \Big) \iff \forall x \Big( g(x) \vee R(x,f(x)) \Big)</math> | |||
where | |||
:<math>f(x)</math> is a function that maps <math>x</math> to <math>y</math>. | |||
Intuitively, the sentence "for every <math>x</math> there exists a <math>y</math> such that <math>R(x,y)</math>" is converted into the equivalent form "there exists a function <math>f</math> mapping every <math>x</math> into a <math>y</math> such that, for every <math>x</math> it holds <math>R(x,f(x))</math>". | |||
This equivalence is useful because the definition of first-order satisfiability implicitly existentially quantifies over the evaluation of function symbols. In particular, a first-order formula <math>\Phi</math> is satisfiable if there exists a model <math>M</math> and an evaluation <math>\mu</math> of the free variables of the formula that evaluate the formula to ''true''. The model contains the evaluation of all function symbols; therefore, Skolem functions are implicitly existentially quantified. In the example above, <math>\forall x . R(x,f(x))</math> is satisfiable if and only if there exists a model <math>M</math>, which contains an evaluation for <math>f</math>, such that <math>\forall x . R(x,f(x))</math> is true for some evaluation of its free variables (none in this case). This can be expressed in second order as <math>\exists f \forall x . R(x,f(x))</math>. By the above equivalence, this is the same as the satisfiability of <math>\forall x \exists y . R(x,y)</math>. | |||
At the meta-level, [[First-order logic#Semantics|first-order satisfiability]] of a formula <math>\Phi</math> can be written with a little abuse of notation as <math>\exists M \exists \mu ~.~ ( M,\mu \models \Phi)</math>, where <math>M</math> is a model, <math>\mu</math> is an evaluation of the free variables., and <math>\models</math> means that <math>\Phi</math> is a [[logical consequence|semantic consequence]] of <math>M</math> and <math>\mu</math>. Since first-order models contain the evaluation of all function symbols, any Skolem function <math>\Phi</math> contains is implicitly existentially quantified by <math>\exists M</math>. As a result, after replacing an existential quantifier over variables into an existential quantifiers over functions at the front of the formula, the formula can still be treated as a first-order one by removing these existential quantifiers. This final step of treating <math>\exists f \forall x . R(x,f(x))</math> as <math>\forall x . R(x,f(x))</math> can be done because functions are implicitly existentially quantified by <math>\exists M</math> in the definition of first-order satisfiability. | |||
Correctness of Skolemization can be shown on the example formula <math>F_1 = \forall x_1 \dots \forall x_n \exists y R(x_1,\dots,x_n,y)</math> as follows. This formula is satisfied by a [[model (abstract)|model]] <math>M</math> if and only if, for each possible value for <math>x_1,\dots,x_n</math> in the domain of the model there exists a value for <math>y</math> in the domain of the model that makes <math>R(x_1,\dots,x_n,y)</math> true. By the [[axiom of choice]], there exists a function <math>f</math> such that <math>y = f(x_1,\dots,x_n)</math>. As a result, the formula <math>F_2 = \forall x_1 \dots \forall x_n R(x_1,\dots,x_n,f(x_1,\dots,x_n))</math> is satisfiable, because it has the model obtained by adding the evaluation of <math>f</math> to <math>M</math>. This shows that <math>F_1</math> is satisfiable only if <math>F_2</math> is satisfiable as well. In the other way around, if <math>F_2</math> is satisfiable, then there exists a model <math>M'</math> that satisfies it; this model includes an evaluation for the function <math>f</math> such that, for every value of <math>x_1,\dots,x_n</math>, the formula <math>R(x_1,\dots,x_n,f(x_1,\dots,x_n))</math> holds. As a result, <math>F_1</math> is satisfied by the same model because one can choose, for every value of <math>x_1,\ldots,x_n</math>, the value <math>y=f(x_1,\dots,x_n)</math>, where <math>f</math> is evaluated according to <math>M'</math>. | |||
==Uses of Skolemization== | |||
{{Expand section|date=January 2007}} | |||
One of the uses of Skolemization is [[automated theorem proving]]. For example, in the [[method of analytic tableaux]], whenever a formula whose leading quantifier is existential occurs, the formula obtained by removing that quantifier via Skolemization can be generated. For example, if <math>\exists x . \Phi(x,y_1,\ldots,y_n)</math> occurs in a tableau, where <math>x,y_1,\ldots,y_n</math> are the free variables of <math>\Phi(x,y_1,\ldots,y_n)</math>, then <math>\Phi(f(y_1,\ldots,y_n),y_1,\ldots,y_n)</math> can be added to the same branch of the tableau. This addition does not alter the satisfiability of the tableau: every model of the old formula can be extended, by adding a suitable evaluation of <math>f</math>, to a model of the new formula. | |||
This form of Skolemization is actually an improvement over "classical" Skolemization in that only variables that are free in the formula are placed in the Skolem term. This is an improvement because the semantics of tableau may implicitly place the formula in the [[Scope (programming)|scope]] of some universally quantified variables that are not in the formula itself; these variables are not in the Skolem term, while they would be there according to the original definition of Skolemization. Another improvement that can be used is using the same Skolem function symbol for formulae that are identical [[up to]] variable renaming.<ref>R. Hähnle. Tableaux and related methods. [[Handbook of Automated Reasoning]].</ref> | |||
Another use is in the [[Resolution_(logic)#Resolution_in_first_order_logic|resolution method for first order logic]], where formulas are represented as sets of [[clause (logic)|clause]]s understood to be universally quantified. (For an example see [[drinker paradox]].) | |||
==Skolem theories== | |||
{{refimprove section|date=October 2012}} | |||
In general, if <math>T</math> is a [[theory (mathematical logic)|theory]] and for each formula <math>F</math> with [[free variable]]s <math>x_1, \dots, x_n, y</math> there is a Skolem function, then <math>T</math> is called a '''Skolem theory'''.<ref>[http://www.math.uu.nl/people/jvoosten/syllabi/logicasyllmoeder.pdf]<!-- Not really a source; I'll substitute something better as soon as I get to a library. Sorry. --></ref> For example, by the above, [[arithmetic]] with the Axiom of Choice is a Skolem theory. | |||
Every Skolem theory is [[model complete theory|model complete]], i.e. every [[substructure]] of a model is an [[elementary equivalence|elementary substructure]]. Given a model ''M'' of a Skolem theory ''T'', the smallest substructure containing a certain set ''A'' is called the '''Skolem hull''' of ''A''. The Skolem hull of ''A'' is an [[atomic model (mathematical logic)|atomic]] [[prime model]] over ''A''. | |||
==Notes== | |||
<references /> | |||
==See also== | |||
* [[Herbrandization]], the dual of Skolemization | |||
* [[Predicate functor logic]] | |||
==References== | |||
* {{Citation | last=Hodges | first=Wilfrid | authorlink=Wilfrid Hodges | title=A shorter model theory | publisher=[[Cambridge University Press]] | isbn=978-0-521-58713-6 | year=1997}} | |||
==External links== | |||
* {{springer|title=Skolem function|id=p/s085740}} | |||
* [http://planetmath.org/encyclopedia/Skolemization.html Skolemization on PlanetMath.org] | |||
* [http://demonstrations.wolfram.com/Skolemization/ Skolemization] by Hector Zenil, [[The Wolfram Demonstrations Project]]. | |||
* {{MathWorld |title=SkolemizedForm |urlname=SkolemizedForm}} | |||
{{DEFAULTSORT:Skolem Normal Form}} | |||
[[Category:Normal forms (logic)]] | |||
[[Category:Model theory]] |
Revision as of 17:11, 15 August 2013
In mathematical logic, reduction to Skolem normal form (SNF) is a method for removing existential quantifiers from formal logic statements, often performed as the first step in an automated theorem prover.
A formula of first-order logic is in Skolem normal form (named after Thoralf Skolem) if it is in prenex normal form with only universal first-order quantifiers. Every first-order formula can be converted into Skolem normal form while not changing its satisfiability via a process called Skolemization (sometimes spelled "Skolemnization"). The resulting formula is not necessarily equivalent to the original one, but is equisatisfiable with it: it is satisfiable if and only if the original one is satisfiable.[1]
The simplest form of Skolemization is for existentially quantified variables which are not inside the scope of a universal quantifier. These can simply be replaced by creating new constants. For example, can be changed to , where is a new constant (does not occur anywhere else in the formula).
More generally, Skolemization is performed by replacing every existentially quantified variable with a term whose function symbol is new. The variables of this term are as follows. If the formula is in prenex normal form, are the variables that are universally quantified and whose quantifiers precede that of . In general, they are the variables that are universally quantified Template:Clarify and such that occurs in the scope of their quantifiers. The function introduced in this process is called a Skolem function (or Skolem constant if it is of zero arity) and the term is called a Skolem term.
As an example, the formula is not in Skolem normal form because it contains the existential quantifier . Skolemization replaces with , where is a new function symbol, and removes the quantification over . The resulting formula is . The Skolem term contains but not because the quantifier to be removed is in the scope of but not in that of ; since this formula is in prenex normal form, this is equivalent to saying that, in the list of quantifers, precedes while does not. The formula obtained by this transformation is satisfiable if and only if the original formula is.
How Skolemization works
Skolemization works by applying a second-order equivalence in conjunction to the definition of first-order satisfiability. The equivalence provides a way for "moving" an existential quantifier before a universal one.
where
Intuitively, the sentence "for every there exists a such that " is converted into the equivalent form "there exists a function mapping every into a such that, for every it holds ".
This equivalence is useful because the definition of first-order satisfiability implicitly existentially quantifies over the evaluation of function symbols. In particular, a first-order formula is satisfiable if there exists a model and an evaluation of the free variables of the formula that evaluate the formula to true. The model contains the evaluation of all function symbols; therefore, Skolem functions are implicitly existentially quantified. In the example above, is satisfiable if and only if there exists a model , which contains an evaluation for , such that is true for some evaluation of its free variables (none in this case). This can be expressed in second order as . By the above equivalence, this is the same as the satisfiability of .
At the meta-level, first-order satisfiability of a formula can be written with a little abuse of notation as , where is a model, is an evaluation of the free variables., and means that is a semantic consequence of and . Since first-order models contain the evaluation of all function symbols, any Skolem function contains is implicitly existentially quantified by . As a result, after replacing an existential quantifier over variables into an existential quantifiers over functions at the front of the formula, the formula can still be treated as a first-order one by removing these existential quantifiers. This final step of treating as can be done because functions are implicitly existentially quantified by in the definition of first-order satisfiability.
Correctness of Skolemization can be shown on the example formula as follows. This formula is satisfied by a model if and only if, for each possible value for in the domain of the model there exists a value for in the domain of the model that makes true. By the axiom of choice, there exists a function such that . As a result, the formula is satisfiable, because it has the model obtained by adding the evaluation of to . This shows that is satisfiable only if is satisfiable as well. In the other way around, if is satisfiable, then there exists a model that satisfies it; this model includes an evaluation for the function such that, for every value of , the formula holds. As a result, is satisfied by the same model because one can choose, for every value of , the value , where is evaluated according to .
Uses of Skolemization
One of the uses of Skolemization is automated theorem proving. For example, in the method of analytic tableaux, whenever a formula whose leading quantifier is existential occurs, the formula obtained by removing that quantifier via Skolemization can be generated. For example, if occurs in a tableau, where are the free variables of , then can be added to the same branch of the tableau. This addition does not alter the satisfiability of the tableau: every model of the old formula can be extended, by adding a suitable evaluation of , to a model of the new formula.
This form of Skolemization is actually an improvement over "classical" Skolemization in that only variables that are free in the formula are placed in the Skolem term. This is an improvement because the semantics of tableau may implicitly place the formula in the scope of some universally quantified variables that are not in the formula itself; these variables are not in the Skolem term, while they would be there according to the original definition of Skolemization. Another improvement that can be used is using the same Skolem function symbol for formulae that are identical up to variable renaming.[2]
Another use is in the resolution method for first order logic, where formulas are represented as sets of clauses understood to be universally quantified. (For an example see drinker paradox.)
Skolem theories
Template:Refimprove section In general, if is a theory and for each formula with free variables there is a Skolem function, then is called a Skolem theory.[3] For example, by the above, arithmetic with the Axiom of Choice is a Skolem theory.
Every Skolem theory is model complete, i.e. every substructure of a model is an elementary substructure. Given a model M of a Skolem theory T, the smallest substructure containing a certain set A is called the Skolem hull of A. The Skolem hull of A is an atomic prime model over A.
Notes
- ↑ Template:Cite web
- ↑ R. Hähnle. Tableaux and related methods. Handbook of Automated Reasoning.
- ↑ [1]
See also
- Herbrandization, the dual of Skolemization
- Predicate functor logic
References
- Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.
Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.
In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.
Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region
Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.
15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.
To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010
External links
- Other Sports Official Kull from Drumheller, has hobbies such as telescopes, property developers in singapore and crocheting. Identified some interesting places having spent 4 months at Saloum Delta.
my web-site http://himerka.com/ - Skolemization on PlanetMath.org
- Skolemization by Hector Zenil, The Wolfram Demonstrations Project.
I had like 17 domains hosted on single account, and never had any special troubles. If you are not happy with the service you will get your money back with in 45 days, that's guaranteed. But the Search Engine utility inside the Hostgator account furnished an instant score for my launched website. Fantastico is unable to install WordPress in a directory which already have any file i.e to install WordPress using Fantastico the destination directory must be empty and it should not have any previous installation files. When you share great information, others will take note. Once your hosting is purchased, you will need to setup your domain name to point to your hosting. Money Back: All accounts of Hostgator come with a 45 day money back guarantee. If you have any queries relating to where by and how to use Hostgator Discount Coupon, you can make contact with us at our site. If you are starting up a website or don't have too much website traffic coming your way, a shared plan is more than enough. Condition you want to take advantage of the worldwide web you prerequisite a HostGator web page, -1 of the most trusted and unfailing web suppliers on the world wide web today. Since, single server is shared by 700 to 800 websites, you cannot expect much speed.
Hostgator tutorials on how to install Wordpress need not be complicated, especially when you will be dealing with a web hosting service that is friendly for novice webmasters and a blogging platform that is as intuitive as riding a bike. After that you can get Hostgator to host your domain and use the wordpress to do the blogging. Once you start site flipping, trust me you will not be able to stop. I cut my webmaster teeth on Control Panel many years ago, but since had left for other hosting companies with more commercial (cough, cough) interfaces. If you don't like it, you can chalk it up to experience and go on. First, find a good starter template design. When I signed up, I did a search for current "HostGator codes" on the web, which enabled me to receive a one-word entry for a discount. Your posts, comments, and pictures will all be imported into your new WordPress blog.