Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
The unambiguous grammar criteria of the types of logical relationships are determined based on the descriptions and examples of AND/OR logical operators in different grammar. It is shown that the type of logic cannot always be determined with the help of grammar. An algorithm for determining the type of logical relationships in a sentence is described. Using individual aspects, speech, grammar and logic are juxtaposed as models of thinking.
Automatic Documentation and Mathematical Linguistics – Springer Journals
Published: Feb 1, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.