How to represent “can” in first order logic?Expressing “Highest” in First Order LogicFirst Order Logic vs First Order TheoryReachability and first-order logicHelp with First Order LogicFirst Order Logic : PredicatesModels of first-order logic and cardinalities of the domainFirst Order Logic XORFirst-order logic validity questionFirst-order logic formula(prime numbers)Can the following idea be expressed in first order logic?

Is there a hemisphere-neutral way of specifying a season?

ssTTsSTtRrriinInnnnNNNIiinngg

Why can't we play rap on piano?

Why didn't Boeing produce its own regional jet?

What about the virus in 12 Monkeys?

Avoiding direct proof while writing proof by induction

Ambiguity in the definition of entropy

Im going to France and my passport expires June 19th

Could the museum Saturn V's be refitted for one more flight?

How to show a landlord what we have in savings?

Do UK voters know if their MP will be the Speaker of the House?

What are some good books on Machine Learning and AI like Krugman, Wells and Graddy's "Essentials of Economics"

Watching something be piped to a file live with tail

Can compressed videos be decoded back to their uncompresed original format?

What reasons are there for a Capitalist to oppose a 100% inheritance tax?

What exploit Are these user agents trying to use?

What is the most common color to indicate the input-field is disabled?

How would I stat a creature to be immune to everything but the Magic Missile spell? (just for fun)

How do I handle a potential work/personal life conflict as the manager of one of my friends?

Size of subfigure fitting its content (tikzpicture)

How to prevent "they're falling in love" trope

CAST throwing error when run in stored procedure but not when run as raw query

Apex Framework / library for consuming REST services

What does “the session was packed” mean in this context?



How to represent “can” in first order logic?


Expressing “Highest” in First Order LogicFirst Order Logic vs First Order TheoryReachability and first-order logicHelp with First Order LogicFirst Order Logic : PredicatesModels of first-order logic and cardinalities of the domainFirst Order Logic XORFirst-order logic validity questionFirst-order logic formula(prime numbers)Can the following idea be expressed in first order logic?













0












$begingroup$


I would like to write the following sentence in first order logic:



"A dove can fly"


Here is my naive guess:



$exists x, dove(x) wedge can(x, fly) $



I don't like this representation, because



"A dove flies"


translates to first order logic as



$exists x, dove(x) wedge fly(x)$



Can anybody comment?










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    "dove can fly" is ambiguous (and not grammatical). It should be "doves can fly" (all doves) or "a dove can fly" or "this particular dove can fly"
    $endgroup$
    – Jair Taylor
    Mar 28 at 20:59










  • $begingroup$
    @JairTaylor, thank you, corrected.
    $endgroup$
    – user1700890
    Mar 28 at 21:03






  • 1




    $begingroup$
    The correct translation depends on the context. In textbook examples, the meaning is more often "a dove can fly," than "a dove is flying."
    $endgroup$
    – Fabio Somenzi
    Mar 28 at 21:14






  • 1




    $begingroup$
    The ambiguity is in the natural language expression; "a dove can fly" seems to mean that doves have the capability to fly, in which case every dove has it : $forall x (text Dove(x) to text CanFly(x))$.
    $endgroup$
    – Mauro ALLEGRANZA
    Mar 29 at 7:21










  • $begingroup$
    @MauroALLEGRANZA. Could you clarify why "A dove can fly" is ambigous? Could you give an example of unambiguous statement?
    $endgroup$
    – user1700890
    Mar 29 at 14:11















0












$begingroup$


I would like to write the following sentence in first order logic:



"A dove can fly"


Here is my naive guess:



$exists x, dove(x) wedge can(x, fly) $



I don't like this representation, because



"A dove flies"


translates to first order logic as



$exists x, dove(x) wedge fly(x)$



Can anybody comment?










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    "dove can fly" is ambiguous (and not grammatical). It should be "doves can fly" (all doves) or "a dove can fly" or "this particular dove can fly"
    $endgroup$
    – Jair Taylor
    Mar 28 at 20:59










  • $begingroup$
    @JairTaylor, thank you, corrected.
    $endgroup$
    – user1700890
    Mar 28 at 21:03






  • 1




    $begingroup$
    The correct translation depends on the context. In textbook examples, the meaning is more often "a dove can fly," than "a dove is flying."
    $endgroup$
    – Fabio Somenzi
    Mar 28 at 21:14






  • 1




    $begingroup$
    The ambiguity is in the natural language expression; "a dove can fly" seems to mean that doves have the capability to fly, in which case every dove has it : $forall x (text Dove(x) to text CanFly(x))$.
    $endgroup$
    – Mauro ALLEGRANZA
    Mar 29 at 7:21










  • $begingroup$
    @MauroALLEGRANZA. Could you clarify why "A dove can fly" is ambigous? Could you give an example of unambiguous statement?
    $endgroup$
    – user1700890
    Mar 29 at 14:11













0












0








0





$begingroup$


I would like to write the following sentence in first order logic:



"A dove can fly"


Here is my naive guess:



$exists x, dove(x) wedge can(x, fly) $



I don't like this representation, because



"A dove flies"


translates to first order logic as



$exists x, dove(x) wedge fly(x)$



Can anybody comment?










share|cite|improve this question











$endgroup$




I would like to write the following sentence in first order logic:



"A dove can fly"


Here is my naive guess:



$exists x, dove(x) wedge can(x, fly) $



I don't like this representation, because



"A dove flies"


translates to first order logic as



$exists x, dove(x) wedge fly(x)$



Can anybody comment?







first-order-logic






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 28 at 21:09







user1700890

















asked Mar 28 at 20:55









user1700890user1700890

1327




1327







  • 1




    $begingroup$
    "dove can fly" is ambiguous (and not grammatical). It should be "doves can fly" (all doves) or "a dove can fly" or "this particular dove can fly"
    $endgroup$
    – Jair Taylor
    Mar 28 at 20:59










  • $begingroup$
    @JairTaylor, thank you, corrected.
    $endgroup$
    – user1700890
    Mar 28 at 21:03






  • 1




    $begingroup$
    The correct translation depends on the context. In textbook examples, the meaning is more often "a dove can fly," than "a dove is flying."
    $endgroup$
    – Fabio Somenzi
    Mar 28 at 21:14






  • 1




    $begingroup$
    The ambiguity is in the natural language expression; "a dove can fly" seems to mean that doves have the capability to fly, in which case every dove has it : $forall x (text Dove(x) to text CanFly(x))$.
    $endgroup$
    – Mauro ALLEGRANZA
    Mar 29 at 7:21










  • $begingroup$
    @MauroALLEGRANZA. Could you clarify why "A dove can fly" is ambigous? Could you give an example of unambiguous statement?
    $endgroup$
    – user1700890
    Mar 29 at 14:11












  • 1




    $begingroup$
    "dove can fly" is ambiguous (and not grammatical). It should be "doves can fly" (all doves) or "a dove can fly" or "this particular dove can fly"
    $endgroup$
    – Jair Taylor
    Mar 28 at 20:59










  • $begingroup$
    @JairTaylor, thank you, corrected.
    $endgroup$
    – user1700890
    Mar 28 at 21:03






  • 1




    $begingroup$
    The correct translation depends on the context. In textbook examples, the meaning is more often "a dove can fly," than "a dove is flying."
    $endgroup$
    – Fabio Somenzi
    Mar 28 at 21:14






  • 1




    $begingroup$
    The ambiguity is in the natural language expression; "a dove can fly" seems to mean that doves have the capability to fly, in which case every dove has it : $forall x (text Dove(x) to text CanFly(x))$.
    $endgroup$
    – Mauro ALLEGRANZA
    Mar 29 at 7:21










  • $begingroup$
    @MauroALLEGRANZA. Could you clarify why "A dove can fly" is ambigous? Could you give an example of unambiguous statement?
    $endgroup$
    – user1700890
    Mar 29 at 14:11







1




1




$begingroup$
"dove can fly" is ambiguous (and not grammatical). It should be "doves can fly" (all doves) or "a dove can fly" or "this particular dove can fly"
$endgroup$
– Jair Taylor
Mar 28 at 20:59




$begingroup$
"dove can fly" is ambiguous (and not grammatical). It should be "doves can fly" (all doves) or "a dove can fly" or "this particular dove can fly"
$endgroup$
– Jair Taylor
Mar 28 at 20:59












$begingroup$
@JairTaylor, thank you, corrected.
$endgroup$
– user1700890
Mar 28 at 21:03




$begingroup$
@JairTaylor, thank you, corrected.
$endgroup$
– user1700890
Mar 28 at 21:03




1




1




$begingroup$
The correct translation depends on the context. In textbook examples, the meaning is more often "a dove can fly," than "a dove is flying."
$endgroup$
– Fabio Somenzi
Mar 28 at 21:14




$begingroup$
The correct translation depends on the context. In textbook examples, the meaning is more often "a dove can fly," than "a dove is flying."
$endgroup$
– Fabio Somenzi
Mar 28 at 21:14




1




1




$begingroup$
The ambiguity is in the natural language expression; "a dove can fly" seems to mean that doves have the capability to fly, in which case every dove has it : $forall x (text Dove(x) to text CanFly(x))$.
$endgroup$
– Mauro ALLEGRANZA
Mar 29 at 7:21




$begingroup$
The ambiguity is in the natural language expression; "a dove can fly" seems to mean that doves have the capability to fly, in which case every dove has it : $forall x (text Dove(x) to text CanFly(x))$.
$endgroup$
– Mauro ALLEGRANZA
Mar 29 at 7:21












$begingroup$
@MauroALLEGRANZA. Could you clarify why "A dove can fly" is ambigous? Could you give an example of unambiguous statement?
$endgroup$
– user1700890
Mar 29 at 14:11




$begingroup$
@MauroALLEGRANZA. Could you clarify why "A dove can fly" is ambigous? Could you give an example of unambiguous statement?
$endgroup$
– user1700890
Mar 29 at 14:11










1 Answer
1






active

oldest

votes


















4












$begingroup$

First-order logic can't represent the possibility that a property holds about an object. In first-order logic you can state that something holds or that something does not hold (through it's negation). Otherwise you can't say anything else about it. You certainly can't represent the notion that a property might hold.



For systems that incorporate certainty and possibility, you can take a look at modal logic.



If you really want to make a distinction between "is flying" and "can fly" in first-order logic, you can set




  • $dove(x)$ to mean "$x$ is a dove",


  • $canfly(x)$ to mean "$x$ can fly" and


  • $fly(x)$ to mean "$x$ is flying".

Then,




  • $exists x(dove(x)land canfly(x))$ means "there is a dove $x$ that can fly" and


  • $exists x(dove(x)land fly(x))$ means "there is a dove $x$ that is flying".


Edit:



1) You could post a new question about this. Maybe someone can answer with more certainty than mine.



2) What does the sentence $exists x(dove(x)land can(x,fly))$ violate in first-order logic?



The sentence itself is syntactically invalid. It does not make sense, because the distinction between terms (objects) and properties is not clear. In $P(x)$, $x$ is a term (a variable, an object) and $P$ is a property that should hold about object $x$. For the sentence to make sense we must assume that $fly$ is an object. So then, $can(x,fly)$ is a property over two objects. However, it is clear that you intended $fly$ to be a property ($fly(x)$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Thank you! I have two questions, 1) Would it be possible to express it using higher order logic. 2) Could you point out what assumptions of FOL are violated in my interpretation: $exists x, dove(x) wedge can(x, fly)$
    $endgroup$
    – user1700890
    Mar 29 at 14:14






  • 1




    $begingroup$
    @user1700890 I've edited my post.
    $endgroup$
    – frabala
    Mar 29 at 14:55






  • 1




    $begingroup$
    @user1700890 can is not a predicate for one, and second: predicates can be paraphrased: for instance, Mike likes chocolate can be said as chocolates are liked by Mike. Now take: x can fly. Paraphrased this is: flys are canned by x... that makes no sense. Third, an n-place predicate relates n number of NOUNS not verbs. Regards.
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:15







  • 1




    $begingroup$
    @BertrandWittgenstein'sGhost "flys are canned" hahahaha... But seriously, resourceful comment!
    $endgroup$
    – frabala
    Mar 30 at 2:20










  • $begingroup$
    @frabala :p hehe
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:21











Your Answer





StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3166411%2fhow-to-represent-can-in-first-order-logic%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









4












$begingroup$

First-order logic can't represent the possibility that a property holds about an object. In first-order logic you can state that something holds or that something does not hold (through it's negation). Otherwise you can't say anything else about it. You certainly can't represent the notion that a property might hold.



For systems that incorporate certainty and possibility, you can take a look at modal logic.



If you really want to make a distinction between "is flying" and "can fly" in first-order logic, you can set




  • $dove(x)$ to mean "$x$ is a dove",


  • $canfly(x)$ to mean "$x$ can fly" and


  • $fly(x)$ to mean "$x$ is flying".

Then,




  • $exists x(dove(x)land canfly(x))$ means "there is a dove $x$ that can fly" and


  • $exists x(dove(x)land fly(x))$ means "there is a dove $x$ that is flying".


Edit:



1) You could post a new question about this. Maybe someone can answer with more certainty than mine.



2) What does the sentence $exists x(dove(x)land can(x,fly))$ violate in first-order logic?



The sentence itself is syntactically invalid. It does not make sense, because the distinction between terms (objects) and properties is not clear. In $P(x)$, $x$ is a term (a variable, an object) and $P$ is a property that should hold about object $x$. For the sentence to make sense we must assume that $fly$ is an object. So then, $can(x,fly)$ is a property over two objects. However, it is clear that you intended $fly$ to be a property ($fly(x)$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Thank you! I have two questions, 1) Would it be possible to express it using higher order logic. 2) Could you point out what assumptions of FOL are violated in my interpretation: $exists x, dove(x) wedge can(x, fly)$
    $endgroup$
    – user1700890
    Mar 29 at 14:14






  • 1




    $begingroup$
    @user1700890 I've edited my post.
    $endgroup$
    – frabala
    Mar 29 at 14:55






  • 1




    $begingroup$
    @user1700890 can is not a predicate for one, and second: predicates can be paraphrased: for instance, Mike likes chocolate can be said as chocolates are liked by Mike. Now take: x can fly. Paraphrased this is: flys are canned by x... that makes no sense. Third, an n-place predicate relates n number of NOUNS not verbs. Regards.
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:15







  • 1




    $begingroup$
    @BertrandWittgenstein'sGhost "flys are canned" hahahaha... But seriously, resourceful comment!
    $endgroup$
    – frabala
    Mar 30 at 2:20










  • $begingroup$
    @frabala :p hehe
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:21















4












$begingroup$

First-order logic can't represent the possibility that a property holds about an object. In first-order logic you can state that something holds or that something does not hold (through it's negation). Otherwise you can't say anything else about it. You certainly can't represent the notion that a property might hold.



For systems that incorporate certainty and possibility, you can take a look at modal logic.



If you really want to make a distinction between "is flying" and "can fly" in first-order logic, you can set




  • $dove(x)$ to mean "$x$ is a dove",


  • $canfly(x)$ to mean "$x$ can fly" and


  • $fly(x)$ to mean "$x$ is flying".

Then,




  • $exists x(dove(x)land canfly(x))$ means "there is a dove $x$ that can fly" and


  • $exists x(dove(x)land fly(x))$ means "there is a dove $x$ that is flying".


Edit:



1) You could post a new question about this. Maybe someone can answer with more certainty than mine.



2) What does the sentence $exists x(dove(x)land can(x,fly))$ violate in first-order logic?



The sentence itself is syntactically invalid. It does not make sense, because the distinction between terms (objects) and properties is not clear. In $P(x)$, $x$ is a term (a variable, an object) and $P$ is a property that should hold about object $x$. For the sentence to make sense we must assume that $fly$ is an object. So then, $can(x,fly)$ is a property over two objects. However, it is clear that you intended $fly$ to be a property ($fly(x)$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Thank you! I have two questions, 1) Would it be possible to express it using higher order logic. 2) Could you point out what assumptions of FOL are violated in my interpretation: $exists x, dove(x) wedge can(x, fly)$
    $endgroup$
    – user1700890
    Mar 29 at 14:14






  • 1




    $begingroup$
    @user1700890 I've edited my post.
    $endgroup$
    – frabala
    Mar 29 at 14:55






  • 1




    $begingroup$
    @user1700890 can is not a predicate for one, and second: predicates can be paraphrased: for instance, Mike likes chocolate can be said as chocolates are liked by Mike. Now take: x can fly. Paraphrased this is: flys are canned by x... that makes no sense. Third, an n-place predicate relates n number of NOUNS not verbs. Regards.
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:15







  • 1




    $begingroup$
    @BertrandWittgenstein'sGhost "flys are canned" hahahaha... But seriously, resourceful comment!
    $endgroup$
    – frabala
    Mar 30 at 2:20










  • $begingroup$
    @frabala :p hehe
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:21













4












4








4





$begingroup$

First-order logic can't represent the possibility that a property holds about an object. In first-order logic you can state that something holds or that something does not hold (through it's negation). Otherwise you can't say anything else about it. You certainly can't represent the notion that a property might hold.



For systems that incorporate certainty and possibility, you can take a look at modal logic.



If you really want to make a distinction between "is flying" and "can fly" in first-order logic, you can set




  • $dove(x)$ to mean "$x$ is a dove",


  • $canfly(x)$ to mean "$x$ can fly" and


  • $fly(x)$ to mean "$x$ is flying".

Then,




  • $exists x(dove(x)land canfly(x))$ means "there is a dove $x$ that can fly" and


  • $exists x(dove(x)land fly(x))$ means "there is a dove $x$ that is flying".


Edit:



1) You could post a new question about this. Maybe someone can answer with more certainty than mine.



2) What does the sentence $exists x(dove(x)land can(x,fly))$ violate in first-order logic?



The sentence itself is syntactically invalid. It does not make sense, because the distinction between terms (objects) and properties is not clear. In $P(x)$, $x$ is a term (a variable, an object) and $P$ is a property that should hold about object $x$. For the sentence to make sense we must assume that $fly$ is an object. So then, $can(x,fly)$ is a property over two objects. However, it is clear that you intended $fly$ to be a property ($fly(x)$).






share|cite|improve this answer











$endgroup$



First-order logic can't represent the possibility that a property holds about an object. In first-order logic you can state that something holds or that something does not hold (through it's negation). Otherwise you can't say anything else about it. You certainly can't represent the notion that a property might hold.



For systems that incorporate certainty and possibility, you can take a look at modal logic.



If you really want to make a distinction between "is flying" and "can fly" in first-order logic, you can set




  • $dove(x)$ to mean "$x$ is a dove",


  • $canfly(x)$ to mean "$x$ can fly" and


  • $fly(x)$ to mean "$x$ is flying".

Then,




  • $exists x(dove(x)land canfly(x))$ means "there is a dove $x$ that can fly" and


  • $exists x(dove(x)land fly(x))$ means "there is a dove $x$ that is flying".


Edit:



1) You could post a new question about this. Maybe someone can answer with more certainty than mine.



2) What does the sentence $exists x(dove(x)land can(x,fly))$ violate in first-order logic?



The sentence itself is syntactically invalid. It does not make sense, because the distinction between terms (objects) and properties is not clear. In $P(x)$, $x$ is a term (a variable, an object) and $P$ is a property that should hold about object $x$. For the sentence to make sense we must assume that $fly$ is an object. So then, $can(x,fly)$ is a property over two objects. However, it is clear that you intended $fly$ to be a property ($fly(x)$).







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Mar 30 at 1:43

























answered Mar 28 at 22:32









frabalafrabala

2,5341122




2,5341122











  • $begingroup$
    Thank you! I have two questions, 1) Would it be possible to express it using higher order logic. 2) Could you point out what assumptions of FOL are violated in my interpretation: $exists x, dove(x) wedge can(x, fly)$
    $endgroup$
    – user1700890
    Mar 29 at 14:14






  • 1




    $begingroup$
    @user1700890 I've edited my post.
    $endgroup$
    – frabala
    Mar 29 at 14:55






  • 1




    $begingroup$
    @user1700890 can is not a predicate for one, and second: predicates can be paraphrased: for instance, Mike likes chocolate can be said as chocolates are liked by Mike. Now take: x can fly. Paraphrased this is: flys are canned by x... that makes no sense. Third, an n-place predicate relates n number of NOUNS not verbs. Regards.
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:15







  • 1




    $begingroup$
    @BertrandWittgenstein'sGhost "flys are canned" hahahaha... But seriously, resourceful comment!
    $endgroup$
    – frabala
    Mar 30 at 2:20










  • $begingroup$
    @frabala :p hehe
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:21
















  • $begingroup$
    Thank you! I have two questions, 1) Would it be possible to express it using higher order logic. 2) Could you point out what assumptions of FOL are violated in my interpretation: $exists x, dove(x) wedge can(x, fly)$
    $endgroup$
    – user1700890
    Mar 29 at 14:14






  • 1




    $begingroup$
    @user1700890 I've edited my post.
    $endgroup$
    – frabala
    Mar 29 at 14:55






  • 1




    $begingroup$
    @user1700890 can is not a predicate for one, and second: predicates can be paraphrased: for instance, Mike likes chocolate can be said as chocolates are liked by Mike. Now take: x can fly. Paraphrased this is: flys are canned by x... that makes no sense. Third, an n-place predicate relates n number of NOUNS not verbs. Regards.
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:15







  • 1




    $begingroup$
    @BertrandWittgenstein'sGhost "flys are canned" hahahaha... But seriously, resourceful comment!
    $endgroup$
    – frabala
    Mar 30 at 2:20










  • $begingroup$
    @frabala :p hehe
    $endgroup$
    – Bertrand Wittgenstein's Ghost
    Mar 30 at 2:21















$begingroup$
Thank you! I have two questions, 1) Would it be possible to express it using higher order logic. 2) Could you point out what assumptions of FOL are violated in my interpretation: $exists x, dove(x) wedge can(x, fly)$
$endgroup$
– user1700890
Mar 29 at 14:14




$begingroup$
Thank you! I have two questions, 1) Would it be possible to express it using higher order logic. 2) Could you point out what assumptions of FOL are violated in my interpretation: $exists x, dove(x) wedge can(x, fly)$
$endgroup$
– user1700890
Mar 29 at 14:14




1




1




$begingroup$
@user1700890 I've edited my post.
$endgroup$
– frabala
Mar 29 at 14:55




$begingroup$
@user1700890 I've edited my post.
$endgroup$
– frabala
Mar 29 at 14:55




1




1




$begingroup$
@user1700890 can is not a predicate for one, and second: predicates can be paraphrased: for instance, Mike likes chocolate can be said as chocolates are liked by Mike. Now take: x can fly. Paraphrased this is: flys are canned by x... that makes no sense. Third, an n-place predicate relates n number of NOUNS not verbs. Regards.
$endgroup$
– Bertrand Wittgenstein's Ghost
Mar 30 at 2:15





$begingroup$
@user1700890 can is not a predicate for one, and second: predicates can be paraphrased: for instance, Mike likes chocolate can be said as chocolates are liked by Mike. Now take: x can fly. Paraphrased this is: flys are canned by x... that makes no sense. Third, an n-place predicate relates n number of NOUNS not verbs. Regards.
$endgroup$
– Bertrand Wittgenstein's Ghost
Mar 30 at 2:15





1




1




$begingroup$
@BertrandWittgenstein'sGhost "flys are canned" hahahaha... But seriously, resourceful comment!
$endgroup$
– frabala
Mar 30 at 2:20




$begingroup$
@BertrandWittgenstein'sGhost "flys are canned" hahahaha... But seriously, resourceful comment!
$endgroup$
– frabala
Mar 30 at 2:20












$begingroup$
@frabala :p hehe
$endgroup$
– Bertrand Wittgenstein's Ghost
Mar 30 at 2:21




$begingroup$
@frabala :p hehe
$endgroup$
– Bertrand Wittgenstein's Ghost
Mar 30 at 2:21

















draft saved

draft discarded
















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3166411%2fhow-to-represent-can-in-first-order-logic%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ