The following pages link to (Q5586197):
Displaying 50 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Categorical pairs and the indicative shift (Q440655) (← links)
- Axioms for a theory of semantic equivalence (Q580325) (← links)
- A logical framework for depiction and image interpretation (Q582146) (← links)
- On a synonymy relation for extensional first order theories. I: A notion of synonymy (Q594088) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- YinYang bipolar logic and bipolar fuzzy logic (Q704147) (← links)
- Categorical invariance and structural complexity in human concept learning (Q734671) (← links)
- Data types over multiple-valued logics (Q752687) (← links)
- Contributions to foundations of probability calculus on the basis of the modal logical calculus \(MC^{\nu}\) or \(MC_*\!^{\nu}.III:\) An analysis of the notions of random variables and probability spaces, based on modal logic (Q789382) (← links)
- On a synonymy relation for extensional first order theories. II: A sufficient criterion for non synonymy. Applications (Q793007) (← links)
- On a synonymy relation for extensional first order theories. III: A necessary and sufficient condition for synonymy (Q801898) (← links)
- Plausible inferences and plausible reasoning (Q805605) (← links)
- Invariance under stuttering in a temporal logic of actions (Q859839) (← links)
- The lack-of-preference law and the corresponding distributions in frequency probability theory (Q881084) (← links)
- Learning with belief levels (Q927871) (← links)
- The nature of the extended analog computer (Q933439) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Complex structures and composite models - An essay on methodology (Q1071699) (← links)
- Recursive categoricity and recursive stability (Q1084103) (← links)
- On the complexity of theories of permutations (Q1088647) (← links)
- Domain-independent formulas and databases (Q1092679) (← links)
- The syntax of nonstandard analysis (Q1101109) (← links)
- On interpretation of inconsistent theories (Q1123189) (← links)
- A theory of implementation and refinement in timed Petri nets (Q1128980) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- Non-monotonic logic. I (Q1140441) (← links)
- Generalized fuzzy set systems and particularization (Q1144553) (← links)
- Intuitionist type theory and the free topos (Q1148318) (← links)
- Difference measurement spaces (Q1161518) (← links)
- Contributions to foundations of probability calculus on the basis of the modal logical calculus MC(nu) or MC*(nu) (Q1164041) (← links)
- Map theory (Q1193653) (← links)
- The interpreted type-free modal calculus \(MC^\infty\). III: Ordinals and cardinals im \(MC^\infty\) (Q1216292) (← links)
- Holographic or Fourier logic (Q1227734) (← links)
- A new approach to the symbolic factorization of multivariate polynomials (Q1228373) (← links)
- Consistency property and model existence theorem for second order negative languages with conjunctions and quantifications over sets of cardinality smaller than a strong limit cardinal of denumerable cofinality (Q1241504) (← links)
- The elimination of descriptions from A. Bressan's modal language \(ML^\nu\) on which the logical calculus \(MC^\nu\) is based (Q1248616) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- The category of complete lattices as a category of algebras (Q1262329) (← links)
- What robots can do: robot programs and effective achievability (Q1274278) (← links)
- Syntactical treatments of propositional attitudes (Q1275601) (← links)
- Elements of intuitionistic fuzzy logic. I (Q1292063) (← links)
- Remark on the intuitionistic fuzzy logics (Q1292072) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- Gödel's incompleteness theorem (Q1331919) (← links)
- Limited reasoning in first-order knowledge bases (Q1343837) (← links)
- A qualitative fuzzy possibilistic logic (Q1344258) (← links)
- The Qu-Prolog unification algorithm: formalisation and correctness (Q1349886) (← links)
- Monadic logic programs and functional complexity (Q1392280) (← links)
- The interpreted type-free modal calculus MC\(^\infty\). I: The type free extensional calculus EC\(^\infty\) involving individuals, and the interpreted language ML\(^\infty\) on which MC\(\infty\) is based (Q1394219) (← links)
