Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

• Username
• Password
• Remember me

• Sign in using OpenID
• Remember me

• Forgot your password?
• Apply for membership

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory internal-categories k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

1. • CommentRowNumber1.
   • CommentAuthorzskoda
   • CommentTimeNov 2nd 2022
   • PermaLink
   Author: zskoda
   Format: MarkdownItexA topic in predicate logic. <a href="https://ncatlab.org/nlab/revision/rule+C/1">v1</a>, <a href="https://ncatlab.org/nlab/show/rule+C">current</a>

   A topic in predicate logic.

   v1, current

2. • CommentRowNumber2.
   • CommentAuthorRodMcGuire
   • CommentTimeNov 3rd 2022
   • PermaLink
   Author: RodMcGuire
   Format: MarkdownItexIsn't this just a Skolem constant, a Skolem function of 0 arguments where an existential variable is replaced by a newly created function that gives a value for it? [https://en.wikipedia.org/wiki/Skolem_normal_form](https://en.wikipedia.org/wiki/Skolem_normal_form) [https://encyclopediaofmath.org/index.php?title=Skolem_function](https://encyclopediaofmath.org/index.php?title=Skolem_function) says they were introduced by Skolem in the 1920s

   Isn’t this just a Skolem constant, a Skolem function of 0 arguments where an existential variable is replaced by a newly created function that gives a value for it?

   https://en.wikipedia.org/wiki/Skolem_normal_form

   https://encyclopediaofmath.org/index.php?title=Skolem_function

   says they were introduced by Skolem in the 1920s

3. • CommentRowNumber3.
   • CommentAuthorzskoda
   • CommentTimeNov 3rd 2022
   • (edited Nov 3rd 2022)
   • PermaLink
   Author: zskoda
   Format: MarkdownItexThe idea is essentially the same, but it is not the same thing. Skolemization is a procedure in model theory, _replacing_ a sentence with equisatisfiable sentence without one existential quantifier, and also a theory with a Skolem theory. Rule C is a notion in _proof theory_, adding a rule of inference (in generalized sense), which is not in pure predicate logic, as a temporary tool, with a basic theorem saying that if a sentence not involving the temporary variable is provable with rule C then it is provable in pure predicate logic as well. As far as who first formalized proof theoretic rule C, Mendelson asserts that it is _likely_ from Rosser, and Mendelson was quite an authority (and certainly quite familiar with Skolemization).

   The idea is essentially the same, but it is not the same thing. Skolemization is a procedure in model theory, replacing a sentence with equisatisfiable sentence without one existential quantifier, and also a theory with a Skolem theory. Rule C is a notion in proof theory, adding a rule of inference (in generalized sense), which is not in pure predicate logic, as a temporary tool, with a basic theorem saying that if a sentence not involving the temporary variable is provable with rule C then it is provable in pure predicate logic as well.

   As far as who first formalized proof theoretic rule C, Mendelson asserts that it is likely from Rosser, and Mendelson was quite an authority (and certainly quite familiar with Skolemization).