Abstract

We define the term ⌜\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ulcorner $$\end{document}a set T of sentential-logical formulae grounds a sentential-logical formula A from a syntactic point of view⌝\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\urcorner $$\end{document} in such a way that A is a syntactic sentential-logical consequence of T, and specific additional syntactic requirements regarding T and A are fulfilled. These additional requirements are developed strictly within the syntactics of sentential-logical languages, the three most important being new, namely: to be atomically minimal, to be minimal in degree, and not to be conjunction-like. Our approach is independent of any specific sentential-logical calculus.