Search results for "TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES"
showing 4 items of 174 documents
Le cadre de sante entre logiques d'utilité économique et logiques de soins hospitaliers
2010
The public hospital first line manager has to organize the activity of his care unit on the basis of arbitrations between two systems of logic that come more and more frequently in conflict: - The market logic / the public hospital logic - The care process logic / the patient's path logic - The function logic / the professional logic - The managerial logic / the logic "bureaucratic"
"If I don’t enjoy it, how are my kids going to enjoy it?" : case study in English grammar teaching
2015
The question over how grammar should be taught has been discussed amongst s everal linguistics scholars. Different grammar teaching methods present different focus on the target language, grammar and learner’s role. All of the methods have their strengths and weaknesses and in order to know which method to pick, one must know all the strengths and weaknesses of these methods. In this case study, a teacher from Central Finland was interviewed on her grammar teaching methods and the reasons behind these methods for fifth-graders. Factors influencing her selection of methods were the grammatical topic to be taught, learners’ different learning styles, relevance of the topic and the most natura…
A Completeness Proof for a Regular Predicate Logic with Undefined Truth Value
2023
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of "is defined" is extended to terms and formulas via a straightforward recursive algorithm. The "is defined" formulas are constructed so that they themselves are always defined. The completeness proof relies on the Henkin construction. For each formula, precisely one of the formula, its negation, and the negation of its "is defined" formula is true on the constructed model. Many other ternary logics in the literature can be reduced to ours. Partial functions …
On the Amount of Nonconstructivity in Learning Recursive Functions
2011
Nonconstructive proofs are a powerful mechanism in mathematics. Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11]. They allow to regard more complicated algorithms from the viewpoint of much more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. In the present paper, the amount of nonconstructivity in learning of recursive functions is studied. Different learning types are compared with respect to the amount of nonconstructivity needed to lea…