# Return to Answer

 2 deleted 156 characters in body edited Jul 29 '18 at 21:10 ChristopherE 5,06511 gold badge1313 silver badges3030 bronze badges You can represent inductive arguments using the various notations used to symbolize first-order logic. However, there is no other sense in which you can “make” them in first-order logic. Some examples of inductive arguments represented in a common notation for first-order logic, in which they are all invalid, include: Pa, Pb, Pc, Pd, Pe |= Pf ∃xPx |= ∀xPx A→B, A→C, A→D, A→E |= A→F There are infinitely many examples. Here is an argument that looks inductive, but is not, because it is deductively valid in first-order logic: (Doman = {a, b, c}) Pa, Pb, Pc |= ∀xPx You can represent inductive arguments using the various notations used to symbolize first-order logic. However, there is no other sense in which you can “make” them in first-order logic. Some examples of inductive arguments represented in a common notation for first-order logic, in which they are all invalid, include: Pa, Pb, Pc, Pd, Pe |= Pf ∃xPx |= ∀xPx A→B, A→C, A→D, A→E |= A→F There are infinitely many examples. Here is an argument that looks inductive, but is not, because it is deductively valid in first-order logic: (Doman = {a, b, c}) Pa, Pb, Pc |= ∀xPx You can represent inductive arguments using the various notations used to symbolize first-order logic. However, there is no other sense in which you can “make” them in first-order logic. Some examples of inductive arguments represented in a common notation for first-order logic, in which they are all invalid, include: Pa, Pb, Pc, Pd, Pe |= Pf ∃xPx |= ∀xPx A→B, A→C, A→D, A→E |= A→F There are infinitely many examples. 1 answered Jul 29 '18 at 0:45 ChristopherE 5,06511 gold badge1313 silver badges3030 bronze badges You can represent inductive arguments using the various notations used to symbolize first-order logic. However, there is no other sense in which you can “make” them in first-order logic. Some examples of inductive arguments represented in a common notation for first-order logic, in which they are all invalid, include: Pa, Pb, Pc, Pd, Pe |= Pf ∃xPx |= ∀xPx A→B, A→C, A→D, A→E |= A→F There are infinitely many examples. Here is an argument that looks inductive, but is not, because it is deductively valid in first-order logic: (Doman = {a, b, c}) Pa, Pb, Pc |= ∀xPx