Keywords: Rough sets; Rough approximation; Near open sets; Incomplete information systems; Accuracy measure; Rule generation; 54A05; 54B05; 54D35; 03B70; 68R01;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 03B44; 03B70; 68T27; 91A40; Games and strategic reasoning; Temporal logic; Equilibria;
Keywords: 03B60; 03B70; 03B05; 68P15; Propositional team logics; Team semantics; Dependence logic; Non-classical logic;
Keywords: 03B70; 03F52; 68Q55; 37A40; Linear logic; Dynamic semantics; Denotational semantics; Interaction graphs; Geometry of interaction; Measurable dynamics;
Keywords: 03B70; 18C20; 18C50; 81P68; Higher-order computation; Quantum computation; Programming language; Geometry of interaction; Denotational semantics; Categorical semantics;
Keywords: 03B70; 03D15; 03F20; 68Q17; Bounded arithmetic; Circuit lower bounds;
Keywords: 03B45; 03C40; 03F07; 03B70; Craig interpolation; Nested sequent; Structural proof theory; Modal logic;
Keywords: 03B42; 03B70; 20A15; 03B60; Information flow; Symmetry; Axiomatization; Completeness;
Keywords: 03B22; 03B70; 03G30; 06A15; 06F07; 18A15
Keywords: 03E60; 03E35; 03B70; 68Q45; 03D05; 68Q15; 68Q17; 03E15Automata and formal languages; Logic in computer science; Gale–Stewart games; 2-tape Büchi automaton; 1-counter automaton; Determinacy; Effective analytic determinacy; Models of set theory; Independenc
Keywords: 03F55; 03B70; 05D10; 68Q99Intuitionism; Ramsey's Theorem; Inductive definitions; Termination of while-programs
Keywords: 68T27; 68T30; 03B70; 68N17Answer set programming; Markov Decision Processes; Stable models; Dynamic domains; Modeling and simulation
Keywords: 03B42; 03B70; 68T27; 68T30Dynamic epistemic logic; Justification Logic; Belief revision; Logical omniscience; Gettier; Evidence
Keywords: 03B70; 03C13; 03C15; 03C45Rosy theory; Finite-variable logic; Finite structures; Amalgamation; þ-Independence; þ-Forking
Keywords: 68Q55; 03B70; 03F52; 18C50Game semantics; Full completeness; History-sensitive strategies; Sequentiality
No finite axiomatizations for posets embeddable into distributive lattices
Keywords: 03C98; 06A11; 06A06; 03B70; Poset; Distributive lattice; Representation; Field of sets; Finite axiomatization; Ultraproduct;
Realizability for Peano arithmetic with winning conditions in HON games
Keywords: 03B70; 03F30; 68Q55; 18D15; Classical realizability; Peano arithmetic; Hyland Ong game semantics;
On unification and admissible rules in Gabbay-de Jongh logics
Keywords: 03B20; 03B22; 03B55; 03B70; Intuitionistic logic; Intermediate logic; Admissible rules; Disjunction property; Extension property;
Unification and admissible rules for paraconsistent minimal Johanssonsʼ logic J and positive intuitionistic logic IPC+
Keywords: 03B43; 03B70; 68T27; 68T15; Paraconsistent minimal Johanssonsʼ logic J; Positive intuitionistic logic; Admissible inference rules; Unifiers; Unification problem;
A game semantics for disjunctive logic programming
Keywords: 03B70; 68N17; 68Q55; 91A40; Logic programming; Disjunctive logic programming; Game semantics; Logic programming semantics;
Unification in linear temporal logic LTL
Keywords: 03B44; 03B70; 03F52; Unification; Linear temporal logic; Unification type;
The Hennessy–Milner equivalence for continuous time stochastic logic with mu-operator
Keywords: 08A70; 03B70; 68Q85; 93E03Applications of universal algebra in computer science; Logic in computer science; Models and methods for concurrent and distributed computing; Stochastic systems, general
The complexity of finite model reasoning in description logics
Keywords: 03B70; 03D15; 68Q17; Description logic; Finite satisfiability; Number restrictions;